Sciweavers

4860 search results - page 384 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
72
Voted
ATAL
2005
Springer
15 years 9 months ago
GACS, an evolutionary approach to the spatial coordination of agents
Our approach to the spatial coordination problem relies on parametrized force fields. Through a quantitative comparison on a complex spatial coordination problem treated with a s...
Fabien Flacher, Olivier Sigaud
131
Voted
3DIM
2003
IEEE
15 years 9 months ago
Image-Based Object Editing
We examine the problem of editing complex 3D objects. We convert the problem of editing a 3D object of arbitrary size and surface properties to a problem of editing a 2D image. We...
Holly E. Rushmeier, José Gomes, Laurent Bal...
144
Voted
ESANN
2006
15 years 5 months ago
OnlineDoubleMaxMinOver: a simple approximate time and information efficient online Support Vector Classification method
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
Daniel Schneegaß, Thomas Martinetz, Michael ...
NIPS
2004
15 years 5 months ago
Computing regularization paths for learning multiple kernels
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
Francis R. Bach, Romain Thibaux, Michael I. Jordan
124
Voted
CSUR
2000
69views more  CSUR 2000»
15 years 3 months ago
The framework approach for constraint satisfaction
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
Pierre Roy, Anne Liret, François Pachet