85 search results - page 10 / 17 » Generalized approximate counting revisited |
100
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
125
Voted
JCST
2008
14 years 11 months ago
2008
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
113
Voted
SIBGRAPI
2008
IEEE
15 years 6 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
Voted
SPIRE
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...