Sciweavers

250 search results - page 38 / 50
» A Parallel Iterative Improvement Stable Matching Algorithm
Sort
View
SPAA
2004
ACM
15 years 3 months ago
Adaptive channel queue routing on k-ary n-cubes
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
Arjun Singh, William J. Dally, Amit K. Gupta, Bria...
GPC
2007
Springer
15 years 3 months ago
Optimal Deployment of Mobile Sensor Networks and Its Maintenance Strategy
Abstract. Sensor network deployment and its maintenance are very challenging due to hostile and unpredictable nature of environments. The field coverage of a wireless sensor networ...
Xiaoling Wu, Jinsung Cho, Brian J. d'Auriol, Sungy...
CVPR
2008
IEEE
15 years 11 months ago
FusionFlow: Discrete-continuous optimization for optical flow estimation
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...
Victor S. Lempitsky, Stefan Roth, Carsten Rother
FOCS
2008
IEEE
15 years 4 months ago
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...
Michael Ben-Or, Avinatan Hassidim
IWMM
2009
Springer
152views Hardware» more  IWMM 2009»
15 years 4 months ago
A new approach to parallelising tracing algorithms
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt