Sciweavers

5595 search results - page 939 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
SIAMSC
2011
148views more  SIAMSC 2011»
15 years 24 days ago
Bootstrap AMG
We develop an algebraic multigrid (AMG) setup scheme based on the bootstrap framework for multiscale scientific computation. Our approach uses a weighted least squares definition...
Achi Brandt, James J. Brannick, K. Kahl, Irene Liv...
188
Voted
ICASSP
2011
IEEE
14 years 10 months ago
Maximum likelihood ICA of quaternion Gaussian vectors
This work considers the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case, and therefore the ICA problem is solved by...
Javier Vía, Daniel P. Palomar, Luis Vielva,...
INFOCOM
2006
IEEE
16 years 11 days ago
Complexity of Wavelength Assignment in Optical Network Optimization
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
Matthew Andrews, Lisa Zhang
SIAMSC
2010
141views more  SIAMSC 2010»
15 years 4 months ago
An Iterative Method for Edge-Preserving MAP Estimation When Data-Noise Is Poisson
In numerous applications of image processing, e.g. astronomical and medical imaging, data-noise is well-modeled by a Poisson distribution. This motivates the use of the negative-lo...
Johnathan M. Bardsley, John Goldes
ICFP
2007
ACM
16 years 6 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson