Sciweavers

405 search results - page 35 / 81
» Efficient decision tree construction on streaming data
Sort
View
IFIP
2004
Springer
14 years 29 days ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
SIGMOD
2005
ACM
162views Database» more  SIGMOD 2005»
14 years 7 months ago
Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
Naga K. Govindaraju, Nikunj Raghuvanshi, Dinesh Ma...
JGTOOLS
2008
100views more  JGTOOLS 2008»
13 years 7 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
AHSWN
2010
103views more  AHSWN 2010»
13 years 7 months ago
Efficient Data Retrieving in Distributed Data-streaming Environments
In a potential distributed application, Automobile Tracking System (ATS), automobile location data is continuously generated, kept in a distributed manner. As large amount of traff...
Jinsong Han, Jun Miao, Jizhong Zhao, Jinpeng Huai,...