6365 search results - page 218 / 1273 » Fast Local Computation Algorithms |
181
Voted
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
181
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Shape from shading (SfS) has always been difficult for real applications due to its intrinsic ill-posedness. In this paper, we propose an interactive SfS method which efficiently ...
161
click to vote
EDBTW
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we thoroughly analyze a distributed procedure for the problem of local database update in a network of database peers, useful for data exchange scenarios. The algorit...
163
Voted
PRL
1998
15 years 6 months ago
1998
Surprisingly simple local learning algorithms are known to outperform many other global non-linear machines. Unfortunately, these algorithms are computationally costly. A means of...
139
click to vote
MICCAI
2005
Springer
16 years 7 months ago
2005
Springer
Computations on tensors have become common with the use of DT-MRI. But the classical Euclidean framework has many defects, and affine-invariant Riemannian metrics have been propose...