3341 search results - page 159 / 669 » On Bounded Queries and Approximation |
160
click to vote
DATESO
2009
15 years 2 months ago
2009
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
147
click to vote
CC
2006
Springer
15 years 4 months ago
2006
Springer
We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are 1-bit long must ask questions that are at least n - 2 bits long, which is nearly equa...
125
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
146
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
136
click to vote
IPL
2007
15 years 4 months ago
2007
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...