Sciweavers

129 search results - page 2 / 26
» Uniform deterministic dictionaries
Sort
View
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 6 months ago
Faster deterministic dictionaries
Rasmus Pagh
CORR
2011
Springer
179views Education» more  CORR 2011»
12 years 11 months ago
Recovery of Sparsely Corrupted Signals
We investigate the recovery of signals exhibiting a sparse representation in a general (i.e., possibly redundant or incomplete) dictionary that are corrupted by additive noise adm...
Christoph Studer, Patrick Kuppinger, Graeme Pope, ...
IJRR
2010
114views more  IJRR 2010»
13 years 3 months ago
Generating Uniform Incremental Grids on SO(3) Using the Hopf Fibration
Abstract The problem of generating uniform deterministic samples over the rotation group, SO(3), is fundamental to many fields, such as computational structural biology, robotics,...
Anna Yershova, Swati Jain, Steven M. LaValle, Juli...
COLING
2008
13 years 6 months ago
Weakly Supervised Supertagging with Grammar-Informed Initialization
Much previous work has investigated weak supervision with HMMs and tag dictionaries for part-of-speech tagging, but there have been no similar investigations for the harder proble...
Jason Baldridge
CORR
2007
Springer
183views Education» more  CORR 2007»
13 years 4 months ago
Compressed Sensing and Redundant Dictionaries
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, whic...
Holger Rauhut, Karin Schnass, Pierre Vandergheynst