Sciweavers

1064 search results - page 81 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
ICCV
2003
IEEE
16 years 6 months ago
Improved Fast Gauss Transform and Efficient Kernel Density Estimation
Evaluating sums of multivariate Gaussians is a common computational task in computer vision and pattern recognition, including in the general and powerful kernel density estimatio...
Changjiang Yang, Ramani Duraiswami, Nail A. Gumero...
HEURISTICS
2008
120views more  HEURISTICS 2008»
15 years 4 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti
CGF
2008
127views more  CGF 2008»
15 years 4 months ago
Fitting Sharp Features with Loop Subdivision Surfaces
Various methods have been proposed for fitting subdivision surfaces to different forms of shape data (e.g., dense meshes or point clouds), but none of these methods effectively de...
Ruotian Ling, Wenping Wang, Dong-Ming Yan
MP
2010
116views more  MP 2010»
15 years 2 months ago
Separation algorithms for 0-1 knapsack polytopes
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
Konstantinos Kaparis, Adam N. Letchford
147
Voted
ICML
2009
IEEE
16 years 5 months ago
Convex variational Bayesian inference for large scale generalized linear models
We show how variational Bayesian inference can be implemented for very large generalized linear models. Our relaxation is proven to be a convex problem for any log-concave model. ...
Hannes Nickisch, Matthias W. Seeger