6365 search results - page 143 / 1273 » Fast Local Computation Algorithms |
165
click to vote
GRID
2007
Springer
15 years 4 months ago
2007
Springer
In the facility location problem (FLP) we are given a set of facilities and a set of clients, each of which is to be served by one facility. The goal is to decide which subset of f...
150
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. The estimation of the epipolar geometry is especially difficult where the putative correspondences include a low percentage of inlier correspondences and/or a large subse...
161
click to vote
CGF
2000
15 years 4 months ago
2000
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P R3 . Nothing is assumed about the geometry,...
131
Voted
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
143
click to vote
DCC
1998
IEEE
15 years 9 months ago
1998
IEEE
Multi-hypothesis motion-compensated prediction extends traditional motion-compensated prediction used in video coding schemes. Known algorithms for block-based multi-hypothesis mo...