Sciweavers

2740 search results - page 151 / 548
» Approximating Component Selection
Sort
View
ECCV
2008
Springer
15 years 4 months ago
Discriminative Locality Alignment
—This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing...
Tianhao Zhang, Dacheng Tao, Jie Yang
VLDB
2005
ACM
109views Database» more  VLDB 2005»
16 years 3 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
15 years 9 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
MP
2002
176views more  MP 2002»
15 years 2 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
15 years 4 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...