1538 search results - page 180 / 308 » Spectral Techniques in Graph Algorithms |
128
click to vote
TASLP
2002
15 years 3 months ago
2002
This paper presents and compares algorithms for combined acoustic echo cancellation and noise reduction for hands-free telephones. A structure is proposed, consisting of a conventi...
134
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
126
click to vote
ISSTA
2009
ACM
15 years 10 months ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
138
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
152
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...