Sciweavers

7 search results - page 2 / 2
» Asymptotic Conditional Probabilities for Conjunctive Queries
Sort
View
MOBICOM
2004
ACM
13 years 11 months ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 6 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais