Sciweavers

17 search results - page 2 / 4
» Tradeoffs in Approximate Range Searching Made Simpler
Sort
View
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
12 years 8 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
NIPS
2004
13 years 6 months ago
Heuristics for Ordering Cue Search in Decision Making
Simple lexicographic decision heuristics that consider cues one at a time in a particular order and stop searching for cues as soon as a decision can be made have been shown to be...
Peter M. Todd, Anja Dieckmann
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
13 years 10 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
PLDI
2010
ACM
13 years 10 months ago
Green: a framework for supporting energy-conscious programming using controlled approximation
Energy-efficient computing is important in several systems ranging from embedded devices to large scale data centers. Several application domains offer the opportunity to tradeof...
Woongki Baek, Trishul M. Chilimbi
KAIS
2006
110views more  KAIS 2006»
13 years 5 months ago
Multi-step density-based clustering
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...