Sciweavers

575 search results - page 40 / 115
» A Spectral Approach to Lower Bounds
Sort
View
JSAC
2006
157views more  JSAC 2006»
13 years 11 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
14 years 3 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
FOCS
2008
IEEE
14 years 5 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
GLOBECOM
2007
IEEE
14 years 5 months ago
Iterative Channel Estimation for IDMA Systems in Time-Varying Channels
— In this paper, we develop low-complexity iterative channel estimation techniques for emerging IDMA systems. The channel estimators make use of pilots as well as soft decoded da...
Xiangyun Zhou, Zhenning Shi, Mark C. Reed
3DIM
2005
IEEE
14 years 27 days ago
Further Improving Geometric Fitting
We give a formal definition of geometric fitting in a way that suits computer vision applications. We point out that the performance of geometric fitting should be evaluated in...
Ken-ichi Kanatani