Sciweavers

520 search results - page 64 / 104
» Reductions Between Expansion Problems
Sort
View
TSP
2010
13 years 3 months ago
Analysis of the Stereophonic LMS/Newton Algorithm and Impact of Signal Nonlinearity on Its Convergence Behavior
The strong cross-correlation that exists between the two input audio channels makes the problem of stereophonic acoustic echo cancellation (AEC) complex and challenging to solve. R...
Harsha I. K. Rao, Behrouz Farhang-Boroujeny
IACR
2011
141views more  IACR 2011»
12 years 8 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
PODC
2012
ACM
11 years 11 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 8 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...
ECCV
2008
Springer
14 years 10 months ago
Texture-Consistent Shadow Removal
This paper presents an approach to shadow removal that preserves texture consistency between the original shadow and lit area. Illumination reduction in the shadow area not only da...
Feng Liu, Michael Gleicher