Sciweavers

774 search results - page 51 / 155
» A subdivision-based algorithm for the sparse resultant
Sort
View
SCALESPACE
2007
Springer
15 years 7 months ago
Non-negative Sparse Modeling of Textures
This paper presents a statistical model for textures that uses a non-negative decomposition on a set of local atoms learned from an exemplar. This model is described by the varianc...
Gabriel Peyré
ICASSP
2011
IEEE
14 years 5 months ago
Promoting convergence in multi-channel blind signal separation using PNLMS
The proportionate normalized least-mean squares (PNLMS) adaptation algorithm exploits the sparse nature of acoustic impulse responses and assigns adaptation gain proportional to t...
Muhammad Z. Ikram
ML
2006
ACM
142views Machine Learning» more  ML 2006»
15 years 1 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....
ICPP
2006
IEEE
15 years 7 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
ICCV
1995
IEEE
15 years 4 months ago
Algorithms for Implicit Deformable Models
This paper presents a framework for implicit deformable models and a pair of new algorithms for solving the nonlinear partial di erential equations that result from this framework...
Ross T. Whitaker