2370 search results - page 134 / 474 » A Structured Set of Higher-Order Problems |
140
Voted
CVPR
2009
IEEE
15 years 7 months ago
2009
IEEE
In this paper we present a novel method for 3D structure acquisition, based on structured light. Unlike classical structured light methods, in which a static projector illuminates...
169
Voted
TALG
2008
15 years 3 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
125
click to vote
KBSE
2002
IEEE
15 years 8 months ago
2002
IEEE
Generating test inputs for a path in a function with integer and real parameters is an important but difficult problem. The problem becomes more difficult when pointers are pass...
146
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
173
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...