Sciweavers

3341 search results - page 98 / 669
» On Bounded Queries and Approximation
Sort
View
ECCC
2006
123views more  ECCC 2006»
14 years 10 months ago
A Note on Adaptivity in Testing Properties of Bounded Degree Graphs
We show that in the bounded degree model for graph property testing, adaptivity is essential. An algorithm is non-adaptive if it makes all queries to the input before receiving an...
Sofya Raskhodnikova, Adam Smith
ICDE
2004
IEEE
144views Database» more  ICDE 2004»
15 years 11 months ago
Spatio-Temporal Aggregation Using Sketches
Several spatio-temporal applications require the retrieval of summarized information about moving objects that lie in a query region during a query interval (e.g., the number of m...
Yufei Tao, George Kollios, Jeffrey Considine, Feif...
FCT
2005
Springer
15 years 3 months ago
The Complexity of Querying External Memory and Streaming Data
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
Martin Grohe, Christoph Koch, Nicole Schweikardt
ECCC
2010
117views more  ECCC 2010»
14 years 8 months ago
Nearly Tight Bounds for Testing Function Isomorphism
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
Sourav Chakraborty, David García-Soriano, A...
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
15 years 10 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall