3341 search results - page 176 / 669 » On Bounded Queries and Approximation |
134
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...
116
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
154
Voted
SIBGRAPI
2008
IEEE
15 years 11 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
136
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
278
click to vote
ICDE
2006
IEEE
16 years 6 months ago
2006
IEEE
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...