903 search results - page 74 / 181 » On the reduction of a random basis |
123
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
We perform a comprehensive theoretical and empirical study of the benefits of singleton consistencies. Our theoretical results help place singleton consistencies within the hierar...
156
click to vote
EUROCRYPT
2005
Springer
15 years 11 months ago
2005
Springer
The Lenstra-Lenstra-Lov´asz lattice basis reduction algorithm (LLL or L3 ) is a very popular tool in public-key cryptanalysis and in many other fields. Given an integer d-dimensi...
206
click to vote
IEEECGIV
2009
IEEE
16 years 25 days ago
2009
IEEE
The theory of compressive sampling involves making random linear projections of a signal. Provided signal is sparse in some basis, small number of such measurements preserves the ...
145
click to vote
GECCO
2007
Springer
16 years 10 days ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
129
click to vote
ICIP
2006
IEEE
16 years 7 days ago
2006
IEEE
Compressive sampling (CS), or “Compressed Sensing,” has recently generated a tremendous amount of excitement in the image processing community. CS involves taking a relatively...