6110 search results - page 1079 / 1222 » Approximate Computing |
146
click to vote
SCAM
2006
IEEE
16 years 9 days ago
2006
IEEE
Traditional program slicing requires two parameters: a program location and a variable, or perhaps a set of variables, of interest. Stop-list slicing adds a third parameter to the...
171
click to vote
LSSC
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
187
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Coalescence, meaning the tracker associates more than one trajectories to some targets while loses track for others, is a challenging problem for visual tracking of multiple targe...
168
click to vote
EMMCVPR
1999
Springer
15 years 10 months ago
1999
Springer
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
187
click to vote
3DIM
2007
IEEE
16 years 20 days ago
2007
IEEE
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...