Sciweavers

264 search results - page 17 / 53
» On Linear Cryptanalysis with Many Linear Approximations
Sort
View
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
16 years 1 hour ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...
ICCV
1995
IEEE
15 years 3 months ago
Estimating the Tensor of Curvature of a Surface from a Polyhedral Approximation
Estimating principal curvatures and principal directions of a surface from a polyhedral approximation with a large number of small faces, such as those produced by iso-surface con...
Gabriel Taubin
ESA
2006
Springer
103views Algorithms» more  ESA 2006»
15 years 3 months ago
Greedy in Approximation Algorithms
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
Julián Mestre
SIAMJO
2011
14 years 6 months ago
Approximating Semidefinite Packing Programs
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
Garud Iyengar, David J. Phillips, Clifford Stein
ICML
2005
IEEE
16 years 15 days ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III