Sciweavers

32 search results - page 5 / 7
» Implementation of Monte Carlo Algorithms for Eigenvalue Prob...
Sort
View
ICASSP
2010
IEEE
13 years 7 months ago
A robust minimum volume enclosing simplex algorithm for hyperspectral unmixing
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...
Arul-Murugan Ambikapathi, Tsung-Han Chan, Wing-Kin...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 7 months ago
GraphLab: A New Framework for Parallel Machine Learning
Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insuf...
Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny B...
ICML
2009
IEEE
14 years 8 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
COMPGEOM
2005
ACM
13 years 9 months ago
Dynamic maintenance of molecular surfaces under conformational changes
We present an efficient algorithm for maintaining the boundary and surface area of protein molecules as they undergo conformational changes. We also describe a robust implementati...
Eran Eyal, Dan Halperin
ICASSP
2009
IEEE
14 years 2 months ago
Convex analysis based minimum-volume enclosing simplex algorithm for hyperspectral unmixing
Abstract—Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspect...
Tsung-Han Chan, Chong-Yung Chi, Yu-Min Huang, Wing...