Sciweavers

1262 search results - page 137 / 253
» Fast Robust Hashing
Sort
View
CCGRID
2011
IEEE
14 years 6 months ago
DHTbd: A Reliable Block-Based Storage System for High Performance Clusters
—Large, reliable and efficient storage systems are becoming increasingly important in enterprise environments. Our research in storage system design is oriented towards the expl...
George Parissis, George Xylomenos, Theodore K. Apo...
DSN
2009
IEEE
15 years 10 months ago
Dynamic content web applications: Crash, failover, and recovery analysis
This work assesses how crashes and recoveries affect the performance of a replicated dynamic content web application. RobustStore is the result of retrofitting TPC-W’s on-line ...
Luiz Eduardo Buzato, Gustavo M. D. Vieira, Willy Z...
ECCV
2006
Springer
16 years 5 months ago
Balanced Exploration and Exploitation Model Search for Efficient Epipolar Geometry Estimation
Abstract. The estimation of the epipolar geometry is especially difficult where the putative correspondences include a low percentage of inlier correspondences and/or a large subse...
Liran Goshen, Ilan Shimshoni
ICDE
2004
IEEE
120views Database» more  ICDE 2004»
16 years 4 months ago
Algebraic Signatures for Scalable Distributed Data Structures
Signatures detect changes to the data objects. Numerous schemes a known, e.g., the popular hash based SHA-1 standard. We propose a nov scheme we call algebraic signatures. We use ...
Witold Litwin, Thomas J. E. Schwarz
98
Voted
IMC
2003
ACM
15 years 8 months ago
Bitmap algorithms for counting active flows on high speed links
—This paper presents a family of bitmap algorithms that address the problem of counting the number of distinct header patterns (flows) seen on a high-speed link. Such counting c...
Cristian Estan, George Varghese, Mike Fisk