Sciweavers

144 search results - page 14 / 29
» Improved Approximation Guarantees for Sublinear-Time Fourier...
Sort
View
SADM
2008
178views more  SADM 2008»
13 years 6 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
DAC
2009
ACM
14 years 8 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
14 years 2 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák
TSP
2008
99views more  TSP 2008»
13 years 7 months ago
Carrier Frequency Offset Mitigation in Asynchronous Cooperative OFDM Transmissions
Carrier frequency offset (CFO) mitigation is critical for orthogonal frequency-division multiplexing (OFDM)-based cooperative transmissions because even small CFO per transmitter m...
Xiaohua Li, Fan Ng, Taewoo Han
CVPR
2009
IEEE
15 years 2 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...