4047 search results - page 153 / 810 » The Discrete Basis Problem |
114
click to vote
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
We discuss the problem of fitting an implicit shape model to a set of points sampled from a co-dimension one manifold of arbitrary topology. The method solves a non-convex optimis...
75
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
We present a theoretical analysis of Watson’s Hierarchicalif-and-only-if (HIFF) problem using a variety of tools. These include schema theory and course graining, the concept of...
122
Voted
ISBI
2007
IEEE
15 years 7 months ago
2007
IEEE
The concept of “Space-Time Sparsity” (STS) penalization is introduced for solving the magnetoencephalography (MEG) inverse problem. The STS approach assumes that events of int...
95
Voted
CAS
2008
15 years 27 days ago
2008
: Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standar...
143
click to vote
NCA
2008
IEEE
15 years 22 days ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...