5169 search results - page 717 / 1034 » Locality approximation using time |
120
click to vote
PODS
2010
ACM
15 years 10 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
172
Voted
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
141
click to vote
ICPR
2000
IEEE
16 years 6 months ago
2000
IEEE
We consider di usion processes on a class of R trees. The processes are de ned in a manner similar to that of Le Gall's Brownian snake. Each point in the tree has a real value...
126
Voted
IPPS
2002
IEEE
15 years 10 months ago
2002
IEEE
In a paper presented last year at WMPP’01 [Walker01], we described the initial prototype of an associative processor implemented using field-programmable logic devices (FPLDs). ...
143
Voted
SASO
2008
IEEE
15 years 11 months ago
2008
IEEE
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...