3341 search results - page 397 / 669 » On Bounded Queries and Approximation |
199
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
173
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
159
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
225
click to vote
CIKM
2004
Springer
15 years 10 months ago
2004
Springer
With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database....
178
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...