19866 search results - page 346 / 3974 » Computing all factorizations in *** |
156
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
199
click to vote
CCCG
2009
15 years 8 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
202
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Cold-start scenarios in recommender systems are situations in which no prior events, like ratings or clicks, are known for certain users or items. To compute predictions in such ca...
184
click to vote
PC
2010
15 years 1 months ago
2010
We study the forward and backward substitution phases of a sparse multifrontal factorization. These phases are often neglected in papers on sparse direct factorization but, in man...
181
click to vote
MICCAI
2005
Springer
16 years 7 months ago
2005
Springer
Many medical imaging applications require the computation of dense correspondence vector fields that match one surface with another. To avoid the need for a large set of manually-d...