Sciweavers

614 search results - page 45 / 123
» Decision Trees for Uncertain Data
Sort
View
FOCS
2008
IEEE
15 years 2 months ago
Hardness of Nearest Neighbor under L-infinity
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
Alexandr Andoni, Dorian Croitoru, Mihai Patrascu
CORR
2008
Springer
74views Education» more  CORR 2008»
15 years 2 months ago
Biased Range Trees
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
Vida Dujmovic, John Howat, Pat Morin
PIMRC
2008
IEEE
15 years 8 months ago
Dynamic data aggregation and transport in wireless sensor networks
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
Mario O. Diaz, Kin K. Leung
CASDMKM
2004
Springer
147views Data Mining» more  CASDMKM 2004»
15 years 7 months ago
Data Set Balancing
This paper conducts experiments with three skewed data sets, seeking to demonstrate problems when skewed data is used, and identifying counter problems when data is balanced. The b...
David L. Olson
KDD
2000
ACM
121views Data Mining» more  KDD 2000»
15 years 5 months ago
Mining high-speed data streams
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
Pedro Domingos, Geoff Hulten