1442 search results - page 69 / 289 » Finding interesting things |
127
click to vote
BMVC
2000
15 years 5 months ago
2000
High-dimensional data, such as images represented as points in the space spanned by their pixel values, can often be described in a significantly smaller number of dimensions than...
129
click to vote
EACL
1993
ACL Anthology
15 years 5 months ago
1993
ACL Anthology
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
637
click to vote
Tutorial
Correlation based matching typically produces dense depth maps by calculating the disparity at each pixel within a neighborhood. This is achieved by taking a square window of certa...
120
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...
151
click to vote
EOR
2008
15 years 4 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...