106 search results - page 13 / 22 » A randomized on-line algorithm for the k-server problem on a... |
SAGA
2007
Springer
14 years 1 months ago
2007
Springer
The line-of-sight networks is a network model introduced recently by Frieze et al. (SODA’07). It considers scenarios of wireless networks in which the underlying environment has...
ICIP
2003
IEEE
14 years 9 months ago
2003
IEEE
Analog video digitized from noisy sources can suffer of line registration problems due to bad synchronization pulses. The effect is that the image lines are randomly shiftedwith r...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
ALGORITHMICA
2010
13 years 7 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
AAAI
2008
13 years 9 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...