Sciweavers

2600 search results - page 257 / 520
» Clustering with or without the Approximation
Sort
View
ICDCSW
2007
IEEE
16 years 17 days ago
Object-Swapping for Resource-Constrained Devices
Mobile devices are still memory-constrained when compared to desktop and laptop computers. Thus, in some circumstances, even while occupied by useful objects, some memory must be ...
Luís Veiga, Paulo Ferreira
BTW
2007
Springer
121views Database» more  BTW 2007»
16 years 13 days ago
Algorithms for merged indexes
B-tree and index into two layers of abstraction. In addition, this paper provides algorithms for (i) concurrency control and recovery including locking of individual keys and of co...
Goetz Graefe
CLEAR
2007
Springer
134views Biometrics» more  CLEAR 2007»
16 years 13 days ago
The ICSI RT07s Speaker Diarization System
Abstract. In this paper, we present the ICSI speaker diarization system. This system was used in the 2007 National Institute of Standards and Technology (NIST) Rich Transcription e...
Chuck Wooters, Marijn Huijbregts
LOCA
2007
Springer
16 years 12 days ago
Inferring the Everyday Task Capabilities of Locations
Abstract. People rapidly learn the capabilities of a new location, without observing every service and product. Instead they map a few observations to familiar clusters of capabili...
Patricia Shanahan, William G. Griswold
NBIS
2007
Springer
16 years 12 days ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero