Sciweavers

1273 search results - page 123 / 255
» Recovery from
Sort
View
134
Voted
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 5 months ago
Hosting Byzantine Fault Tolerant Services on a Chord Ring
In this paper we demonstrate how stateful Byzantine Fault Tolerant services may be hosted on a Chord ring. The strategy presented is fourfold: firstly a replication scheme that di...
Alan Dearle, Graham N. C. Kirby, Stuart J. Norcros...
173
Voted
TIT
2010
130views Education» more  TIT 2010»
14 years 11 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
CVPR
2007
IEEE
15 years 11 months ago
Single View Human Action Recognition using Key Pose Matching and Viterbi Path Searching
3D human pose recovery is considered as a fundamental step in view-invariant human action recognition. However, inferring 3D poses from a single view usually is slow due to the la...
Fengjun Lv, Ramakant Nevatia
TIFS
2008
102views more  TIFS 2008»
15 years 4 months ago
Insertion, Deletion Codes With Feature-Based Embedding: A New Paradigm for Watermark Synchronization With Applications to Speech
A framework is proposed for synchronization in feature-based data embedding systems that is tolerant of errors in estimated features. The method combines feature-based embedding wi...
David J. Coumou, Gaurav Sharma
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
16 years 5 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka