Sciweavers

2531 search results - page 266 / 507
» Group testing in graphs
Sort
View
ASPDAC
2001
ACM
137views Hardware» more  ASPDAC 2001»
15 years 10 months ago
Optimized address assignment for DSPs with SIMD memory accesses
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
Markus Lorenz, David Koffmann, Steven Bashford, Ra...
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 8 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
ICASSP
2010
IEEE
15 years 6 months ago
Towards multi-speaker unsupervised speech pattern discovery
In this paper, we explore the use of a Gaussian posteriorgram based representation for unsupervised discovery of speech patterns. Compared with our previous work, the new approach...
Yaodong Zhang, James R. Glass
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 6 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...
RSA
2008
89views more  RSA 2008»
15 years 6 months ago
Simple permutations mix even better
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask how many randomly selected simple permutations need be composed to...
Alex Brodsky, Shlomo Hoory