6004 search results - page 435 / 1201 » Parallelizing query optimization |
362
click to vote
ICDE
2007
IEEE
16 years 9 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...
222
Voted
MIDDLEWARE
2004
Springer
16 years 27 days ago
2004
Springer
The Internet provides a wealth of useful information in a vast number of dynamic information sources, but it is difficult to determine which sources are useful for a given query. ...
212
click to vote
ICPPW
2002
IEEE
16 years 14 days ago
2002
IEEE
The aim of this work is to provide a high performance air quality simulation using the STEM-II (Sulphur Transport Eulerian Model 2) program. First of all we optimize the sequentia...
209
click to vote
STOC
2009
ACM
16 years 8 months ago
2009
ACM
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
194
Voted
SIGMETRICS
2010
ACM
16 years 10 days ago
2010
ACM
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...