Sciweavers

806 search results - page 110 / 162
» Lower Bounds on Correction Networks
Sort
View
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
15 years 6 months ago
Priority Queues Resilient to Memory Faults
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
Allan Grønlund Jørgensen, Gabriel Mo...
PDCAT
2005
Springer
15 years 5 months ago
A New Algorithm to Solve Synchronous Consensus for Dependent Failures
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
Jun Wang, Min Song
ECCV
2000
Springer
15 years 4 months ago
How Does CONDENSATION Behave with a Finite Number of Samples?
Abstract. Condensation is a popular algorithm for sequential inference that resamples a sampled representation of the posterior. The algorithm is known to be asymptotically correct...
Oliver D. King, David A. Forsyth
DRM
2008
Springer
15 years 1 months ago
A decision theoretic framework for analyzing binary hash-based content identification systems
Content identification has many applications, ranging from preventing illegal sharing of copyrighted content on video sharing websites, to automatic identification and tagging of ...
Avinash L. Varna, Ashwin Swaminathan, Min Wu
GRAPHICSINTERFACE
2007
15 years 1 months ago
Robust pixel classification for 3D modeling with structured light
Modeling 3D objects and scenes is an important part of computer graphics. One approach to modeling is projecting binary patterns onto the scene in order to obtain correspondences ...
Yi Xu, Daniel G. Aliaga