3204 search results - page 510 / 641 » The Alcuin Number of a Graph |
192
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
205
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
180
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
235
click to vote
PODC
2012
ACM
13 years 9 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
161
Voted
FOCS
1993
IEEE
15 years 11 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...