806 search results - page 83 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
122
click to vote
SDM
2008
SIAM
15 years 2 months ago
2008
SIAM
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
192
Voted
ICDE
2002
IEEE
16 years 2 months ago
2002
IEEE
Overlapping and multi-version techniques are two popular frameworks that transform an ephemeral index into a multiple logical-tree structure in order to support versioning databas...
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
126
click to vote
PDP
2008
IEEE
15 years 7 months ago
2008
IEEE
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
228
click to vote
ICDE
2007
IEEE
16 years 2 months ago
2007
IEEE
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...