373 search results - page 29 / 75 » Nearness and uniform convergence |
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
ALGORITHMICA
2010
13 years 8 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper presents a differential optical flow method which accounts for two typical motion-estimation problems : (1) flow regularization within regions of uniform motion while (...
PE
1998
Springer
13 years 7 months ago
1998
Springer
Asymptotic approximations are constructed for the performance measures of product form queueing networks consisting of single server, fixed rate nodes with large populations. The...
CLUSTER
2008
IEEE
14 years 2 months ago
2008
IEEE
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...