806 search results - page 105 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
WOWMOM
2005
ACM
14 years 2 months ago
2005
ACM
Both Mobile Ad Hoc Networks (MANETs) and Peer-toPeer (P2P) Networks are decentralized and self-organizing networks with dynamic topology and responsible for routing queries in a d...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper we explore database segmentation in the context of a column-store DBMS targeted at a scientific database. We present a novel hardware- and scheme-oblivious segmentati...
SAC
2005
ACM
14 years 2 months ago
2005
ACM
: Traditional spatial indexes like R-tree usually assume the database is not updated frequently. In applications like location-based services and sensor networks, this assumption i...
EDBT
2006
ACM
14 years 9 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
ESOP
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...