Sciweavers

3838 search results - page 584 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
90
Voted
SADM
2008
178views more  SADM 2008»
14 years 9 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
93
Voted
CVPR
2004
IEEE
16 years 7 days ago
Model-Based Motion Clustering Using Boosted Mixture Modeling
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
Vladimir Pavlovic
85
Voted
GECCO
2009
Springer
138views Optimization» more  GECCO 2009»
15 years 4 months ago
IMAD: in-execution malware analysis and detection
The sophistication of computer malware is becoming a serious threat to the information technology infrastructure, which is the backbone of modern e-commerce systems. We, therefore...
Syed Bilal Mehdi, Ajay Kumar Tanwani, Muddassar Fa...
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 1 months ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack
86
Voted
PLDI
1995
ACM
15 years 1 months ago
Selective Specialization for Object-Oriented Languages
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
Jeffrey Dean, Craig Chambers, David Grove