Sciweavers

251 search results - page 35 / 51
» When Is Nearest Neighbors Indexable
Sort
View
VLDB
2004
ACM
227views Database» more  VLDB 2004»
14 years 26 days ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
EDBT
2009
ACM
207views Database» more  EDBT 2009»
13 years 10 months ago
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...
Reynold Cheng, Lei Chen 0002, Jinchuan Chen, Xike ...
ICCBR
2009
Springer
14 years 2 months ago
Conceptual Neighborhoods for Retrieval in Case-Based Reasoning
Abstract. We present a case-based reasoning technique based on conceptual neighborhoods of cases. The system applies domain knowledge to the case retrieval process in the form of r...
Ben G. Weber, Michael Mateas
CDC
2008
IEEE
148views Control Systems» more  CDC 2008»
14 years 2 months ago
Distributed cut detection in sensor networks
— We propose a distributed algorithm to detect “cuts” in sensor networks, i.e., the failure of a set of nodes that separates the networks into two or more components. The alg...
Prabir Barooah
3DIM
2003
IEEE
14 years 25 days ago
Taking Consensus of Signed Distance Field for Complementing Unobservable Surface
When we use range finders to observe the shape of an object, many occluded areas may occur. These become holes and gaps in the model and make it undesirable to utilize the model ...
Ryusuke Sagawa, Katsushi Ikeuchi