1611 search results - page 138 / 323 » Queries Independent of Updates |
TALG
2008
14 years 10 months ago
2008
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
185
click to vote
ICDE
2000
IEEE
15 years 11 months ago
2000
IEEE
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
101
Voted
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
76
Voted
ICIP
2005
IEEE
16 years 4 days ago
2005
IEEE
We present a robust algorithm for point tracking on deformable objects. The key elements are the use of orientation selective rank features (ranklets), local filter adaptation and...