2434 search results - page 142 / 487 » Algorithmic Randomness of Closed Sets |
132
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
149
Voted
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
137
Voted
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
For the past few years researches have been investigating enhancing tracking performance by combining several different tracking algorithms. We propose an analytically justified, ...
149
Voted
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— We consider wireless multihop data networks with random multi-access mechanisms at the MAC layer. Our aim is to study the performance as perceived by users in a dynamic setting...
129
Voted
EURONGI
2006
Springer
15 years 7 months ago
2006
Springer
We consider wireless multihop data networks with random multi-access mechanisms at the MAC layer. In general, our aim is to study the performance as perceived by users in a dynamic...