Sciweavers

5463 search results - page 953 / 1093
» Evaluating algorithms that learn from data streams
Sort
View
EDBT
2006
ACM
255views Database» more  EDBT 2006»
16 years 4 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald
SIGCOMM
2005
ACM
15 years 10 months ago
A case study in building layered DHT applications
Recent research has shown that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. One question that is often left unanswered is that ...
Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasa...
MOBICOM
2000
ACM
15 years 9 months ago
A scalable low-latency cache invalidation strategy for mobile environments
—Caching frequently accessed data items on the client side is an effective technique for improving performance in a mobile environment. Classical cache invalidation strategies ar...
Guohong Cao
ERCIMDL
1999
Springer
117views Education» more  ERCIMDL 1999»
15 years 9 months ago
Predicting Indexer Performance in a Distributed Digital Library
Resource discovery in a distributed digital library poses many challenges, one of which is how to choose search engines for query distribution, given a query and a set of search e...
Naomi Dushay, James C. French, Carl Lagoze
EMMCVPR
1997
Springer
15 years 8 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann