Sciweavers

1262 search results - page 27 / 253
» Fast Robust Hashing
Sort
View
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
15 years 4 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
INDOCRYPT
2001
Springer
15 years 3 months ago
Mobile Agent Route Protection through Hash-Based Mechanisms
Abstract. One approach to secure mobile agent execution is restricting the agent route to trusted environments. A necessary condition for this approach to be practical is that the ...
Josep Domingo-Ferrer
FGR
2011
IEEE
245views Biometrics» more  FGR 2011»
14 years 2 months ago
Fast and robust appearance-based tracking
— We introduce a fast and robust subspace-based approach to appearance-based object tracking. The core of our approach is based on Fast Robust Correlation (FRC), a recently propo...
Stephan Liwicki, Stefanos Zafeiriou, Georgios Tzim...
ICA
2007
Springer
15 years 5 months ago
A Robust Complex FastICA Algorithm Using the Huber M-Estimator Cost Function
In this paper, we propose to use the Huber M-estimator cost function as a contrast function within the complex FastICA algorithm of Bingham and Hyvarinen for the blind separation o...
Jih-Cheng Chao, Scott C. Douglas
82
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 10 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy