Sciweavers

3049 search results - page 54 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICASSP
2011
IEEE
14 years 7 months ago
Analysis of adaptive feedback and echo cancelation algorithms in a general multiple-microphone and single-loudspeaker system
In this paper, we analyze a general multiple-microphone and singleloudspeaker system, where an adaptive algorithm is used to cancel acoustic feedback/echo and a beamformer process...
Meng Guo, Thomas Bo Elmedyb, Søren Holdt Je...
CCGRID
2003
IEEE
15 years 9 months ago
Distributed Computing with Hierarchical Master-worker Paradigm for Parallel Branch and Bound Algorithm
This paper discusses the impact of the hierarchical master-worker paradigm on performance of an application program, which solves an optimization problem by a parallel branch and ...
Kento Aida, Wataru Natsume, Yoshiaki Futakata
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
15 years 5 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
15 years 2 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Alexandr Andoni, Huy L. Nguyen
AI
2011
Springer
14 years 7 months ago
Parallelizing a Convergent Approximate Inference Method
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
Ming Su, Elizabeth Thompson