Sciweavers

391 search results - page 25 / 79
» Comparison-Based Algorithms Are Robust and Randomized Algori...
Sort
View
IPTPS
2003
Springer
14 years 25 days ago
A Simple Fault Tolerant Distributed Hash Table
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
Moni Naor, Udi Wieder
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 2 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
FGR
2004
IEEE
200views Biometrics» more  FGR 2004»
13 years 11 months ago
Using Random Subspace to Combine Multiple Features for Face Recognition
LDA is a popular subspace based face recognition approach. However, it often suffers from the small sample size problem. When dealing with the high dimensional face data, the LDA ...
Xiaogang Wang, Xiaoou Tang
PAMI
2010
249views more  PAMI 2010»
13 years 6 months ago
Fast Keypoint Recognition Using Random Ferns
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Michael Calonder, Vincent Le...
IWCMC
2006
ACM
14 years 1 months ago
On the robustness of grid-based deployment in wireless sensor networks
Grid-based sensor deployment is an effective and efficient practice for provisioning wireless sensor networks. Previous work has addressed grid-based deployment of sensors in orde...
Kenan Xu, Glen Takahara, Hossam S. Hassanein