Sciweavers

101 search results - page 7 / 21
» The Intractability of Computing the Hamming Distance
Sort
View
DCC
2007
IEEE
14 years 7 months ago
Bounds to the Rate Distortion Tradeoff of the Binary Markov Source
We provide bounds to the rate distortion tradeoff of the binary Markov source with the Hamming distance as the distortion measure. The tradeoff has been completely characterized b...
Dinkar Vasudevan
ICCV
2009
IEEE
15 years 15 days ago
Is a detector only good for detection?
A common design of an object recognition system has two steps, a detection step followed by a foreground withinclass classification step. For example, consider face detection by...
Quan Yuan and Stan Sclaroff
CVPR
2010
IEEE
14 years 3 months ago
SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
Ruei-Sung Lin, David Ross, Jay Yagnik
DSN
2007
IEEE
13 years 11 months ago
Determining Fault Tolerance of XOR-Based Erasure Codes Efficiently
We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss ...
Jay J. Wylie, Ram Swaminathan
ICPP
1995
IEEE
13 years 11 months ago
Unicasting in Faulty Hypercubes Using Safety Levels
—We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes a...
Jie Wu