Sciweavers

206 search results - page 22 / 42
» Three Heads are Better than One
Sort
View
INFOCOM
2000
IEEE
15 years 2 months ago
An Empirical Evaluation of Client-Side Server Selection Algorithms
—Efficient server selection algorithms reduce retrieval time for objects replicated on different servers and are an important component of Internet cache architectures. This pap...
Sandra G. Dykes, Kay A. Robbins, Clinton L. Jeffer...
EDCC
1999
Springer
15 years 1 months ago
A Fault Tolerant Clock Synchronization Algorithm for Systems with Low-Precision Oscillators
In this paper we present a new fault tolerant clock synchronization algorithm called the Fault Tolerant Daisy Chain algorithm. It is intended for internal clock synchronization of...
Henrik Lönn
EDBT
1998
ACM
131views Database» more  EDBT 1998»
15 years 1 months ago
Processing Complex Similarity Queries with Distance-Based Access Methods
Efficient evaluation of similarity queries is one of the basic requirements for advanced multimedia applications. In this paper, we consider the relevant case where complex similar...
Paolo Ciaccia, Marco Patella, Pavel Zezula
CHI
1997
ACM
15 years 1 months ago
Effective View Navigation
Searching for an item in a long ordered list is a frequent task when using any kind of computing device (from desktop PCs to mobile phones). This paper explores three different int...
George W. Furnas
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
15 years 1 months ago
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
Stefanos Ougiaroglou, Alexandros Nanopoulos, Apost...