Sciweavers

2477 search results - page 182 / 496
» Approximate extended formulations
Sort
View
ACST
2006
15 years 6 months ago
Experimental study of hybrid-type distributed maximal constraint satisfaction algorithm
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
Masato Noto, Masahito Kurihara
GRAPHICSINTERFACE
2004
15 years 6 months ago
Perspective Accurate Splatting
We present a novel algorithm for accurate, high quality point rendering, which is based on the formulation of splatting using homogeneous coordinates. In contrast to previous meth...
Matthias Zwicker, Jussi Räsänen, Mario B...
SODA
2001
ACM
163views Algorithms» more  SODA 2001»
15 years 6 months ago
Algorithms for facility location problems with outliers
d Abstract) Moses Charikar Samir Khullery David M. Mountz Giri Narasimhanx Facility location problems are traditionally investigated with the assumption that all the clients are t...
Moses Charikar, Samir Khuller, David M. Mount, Gir...
150
Voted
ICASSP
2010
IEEE
15 years 4 months ago
Kronecker product matrices for compressive sensing
Compressive sensing (CS) is an emerging approach for acquisition of signals having a sparse or compressible representation in some basis. While CS literature has mostly focused on...
Marco F. Duarte, Richard G. Baraniuk
ICASSP
2010
IEEE
15 years 4 months ago
Maximum-likelihood-based cepstral inverse filtering for blind speech dereverberation
Current state-of-the-art speech recognition systems work quite well in controlled environments but their performance degrades severely in realistic acoustical conditions in reverb...
Kshitiz Kumar, Richard M. Stern