Sciweavers

2157 search results - page 320 / 432
» Optimal Fast Hashing
Sort
View
SIGMOD
2010
ACM
208views Database» more  SIGMOD 2010»
15 years 3 months ago
Hierarchically organized skew-tolerant histograms for geographic data objects
Histograms have been widely used for fast estimation of query result sizes in query optimization. In this paper, we propose a new histogram method, called the Skew-Tolerant Histog...
Yohan J. Roh, Jae Ho Kim, Yon Dohn Chung, Jin Hyun...
DC
2007
15 years 3 months ago
The overhead of consensus failure recovery
Abstract Many reliable distributed systems are consensusbased and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery m...
Partha Dutta, Rachid Guerraoui, Idit Keidar
JCP
2006
128views more  JCP 2006»
15 years 3 months ago
A Service Oriented Framework for Multimedia Radio Networks
- In order to enable fast deployment of new emerging services over multimedia radio networks, it is important to design an efficient service-based platform with necessary traffic m...
Asma Ben Letaifa, Sami Tabbane, Zièd Chouka...
PAMI
2008
208views more  PAMI 2008»
15 years 3 months ago
BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
PE
2008
Springer
109views Optimization» more  PE 2008»
15 years 3 months ago
A conditional probability approach to M/G/1-like queues
Following up on a recently renewed interest in computational methods for M/G/1-type processes, this paper considers an M/G/1-like system in which the service time distribution is ...
Alexandre Brandwajn, Hongyun Wang