Sciweavers

1301 search results - page 18 / 261
» Bounded Version Vectors
Sort
View
TOC
2008
71views more  TOC 2008»
14 years 11 months ago
The One-Way Communication Complexity of Hamming Distance
Abstract: Consider the following version of the Hamming distance problem for
T. S. Jayram, Ravi Kumar, D. Sivakumar
ISCAS
2008
IEEE
173views Hardware» more  ISCAS 2008»
15 years 6 months ago
Analysis of video filtering on the cell processor
— In this paper an analysis of bi-dimensional video filtering on the Cell Broadband Engine Processor is presented. To evaluate the processor, a highly adaptive filtering algori...
Arnaldo Azevedo, Cor Meenderinck, Ben H. H. Juurli...
ASAP
2005
IEEE
182views Hardware» more  ASAP 2005»
15 years 5 months ago
A Thread and Data-Parallel MPEG-4 Video Encoder for a System-On-Chip Multiprocessor
We studied the dynamic instruction count reduction for a single-thread, vectorized and a multi-threaded, non-vectorized, MPEG-4 video encoder. Results indicate a maximum improveme...
Tom R. Jacobs, José L. Núñez-...
CPM
2010
Springer
140views Combinatorics» more  CPM 2010»
15 years 4 months ago
Bounds on the Minimum Mosaic of Population Sequences under Recombination
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
Yufeng Wu
VLSID
2006
IEEE
94views VLSI» more  VLSID 2006»
15 years 5 months ago
On the Size and Generation of Minimal N-Detection Tests
The main result of this paper, proved as a theorem, is that a lower bound on the number of test vectors that detect each fault at least N times is N
Kalyana R. Kantipudi