714 search results - page 70 / 143 » An efficient algorithm for positive realizations |
119
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
147
click to vote
SIAMMAX
2010
14 years 6 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
ICML
2008
IEEE
16 years 20 days ago
2008
IEEE
In one-class classification we seek a rule to find a coherent subset of instances similar to a few positive examples in a large pool of instances. The problem can be formulated an...
VL
1990
IEEE
15 years 3 months ago
1990
IEEE
This paper describes a new approach to specifying graphical layouts of arbitrary objects, which is based on a TEXlike notation. Our simplest scheme offers specifications similar t...
105
click to vote
CGI
2004
IEEE
15 years 3 months ago
2004
IEEE
This paper presents a powerful variant of the ICP (Iterative Closest Point) algorithm for registering range images using a probability field. The probability field (p-field) repre...