3341 search results - page 6 / 669 » On Bounded Queries and Approximation |
143
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
156
Voted
DC
2008
15 years 3 months ago
2008
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
162
Voted
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
126
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
243
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...