2523 search results - page 232 / 505 » Objective: In Minimum Context |
189
Voted
PG
2002
IEEE
15 years 10 months ago
2002
IEEE
We present a novel use of commodity graphics hardware that effectively combines a plane-sweeping algorithm with view synthesis for real-time, on-line 3D scene acquisition and view...
152
Voted
EMMCVPR
2001
Springer
15 years 10 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
145
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes s...
136
click to vote
CIAC
2000
Springer
15 years 9 months ago
2000
Springer
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
138
click to vote
SIGCOMM
1999
ACM
15 years 9 months ago
1999
ACM
The more information about current network conditions available to a transport protocol, the more efficiently it can use the network to transfer its data. In networks such as the...