133 search results - page 21 / 27 » Approximation bounds for Black Hole Search problems |
109
Voted
STOC
2009
ACM
16 years 8 days ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
133
click to vote
SIGECOM
2011
ACM
14 years 2 months ago
2011
ACM
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...
SIGMOD
2010
ACM
15 years 3 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
123
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
We describe an algorithm for similar-image search which
is designed to be efficient for extremely large collections of
images. For each query, a small response set is selected by...
112
click to vote
IAT
2009
IEEE
15 years 6 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....