5153 search results - page 453 / 1031 » Introduction to Randomized Algorithms |
154
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
175
click to vote
PAMI
2007
15 years 5 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
197
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
190
click to vote
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
200
click to vote
WADS
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...