Sciweavers

3823 search results - page 207 / 765
» Experiments with Random Projection
Sort
View
152
Voted
SCALESPACE
2007
Springer
16 years 12 days ago
Best Basis Compressed Sensing
This paper proposes an extension of compressed sensing that allows to express the sparsity prior in a dictionary of bases. This enables the use of the random sampling strategy of c...
Gabriel Peyré
ICRA
2000
IEEE
124views Robotics» more  ICRA 2000»
15 years 10 months ago
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, ...
Joaquín Bautista, Raúl Suárez...
ACL
2008
15 years 7 months ago
A Generic Sentence Trimmer with CRFs
The paper presents a novel sentence trimmer in Japanese, which combines a non-statistical yet generic tree generation model and Conditional Random Fields (CRFs), to address improv...
Tadashi Nomoto
ESANN
2004
15 years 7 months ago
Robust overcomplete matrix recovery for sparse sources using a generalized Hough transform
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...
Fabian J. Theis, Pando G. Georgiev, Andrzej Cichoc...
AAAI
1994
15 years 7 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter