719 search results - page 59 / 144 » Solving Sparse Linear Constraints |
104
click to vote
COLT
2005
Springer
15 years 4 months ago
2005
Springer
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
133
click to vote
MM
2006
ACM
15 years 4 months ago
2006
ACM
Segmentation of video foreground objects from background has many important applications, such as human computer interaction, video compression, multimedia content editing and man...
112
Voted
CONSTRAINTS
2008
14 years 11 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
106
click to vote
PPDP
2010
Springer
14 years 9 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
ICASSP
2008
IEEE
15 years 5 months ago
2008
IEEE
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of measurements. The results in the literature have focuse...