1330 search results - page 185 / 266 » Dynamic Data Structures for Fat Objects and Their Applicatio... |
146
click to vote
WWW
2009
ACM
16 years 29 days ago
2009
ACM
This paper presents an end-user-oriented programming environment called Mashroom. Major contributions herein include an end-user programming model with an expressive data structur...
161
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
173
click to vote
EGPGV
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents a new interactive parallel method for direct visualization of large particle datasets. Based on a parallel rendering cluster, a frame rate of 9 frames-per-seco...
185
click to vote
BTW
2007
Springer
15 years 10 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
181
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
The characteristics of irregular algorithms make a parallel implementation difficult, especially for PC clusters or clusters of SMPs. These characteristics may include an unpredi...