2489 search results - page 194 / 498 » On the Subgroup Distance Problem |
121
Voted
IJCAI
2007
15 years 6 months ago
2007
In many planning situations, a planner is required to return a diverse set of plans satisfying the same goals which will be used by the external systems collectively. We take a do...
144
click to vote
AAAI
2006
15 years 6 months ago
2006
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embedding algorithms are designed to handle objects of a single type for which pair...
168
click to vote
BIOCOMP
2006
15 years 6 months ago
2006
Computation of multiple sequence alignments is one of the major open problems in computational molecular biology. The purpose of this study was to provide a new method, PAC (Progre...
132
click to vote
ICONIP
2004
15 years 5 months ago
2004
Algorithms for nonlinear dimensionality reduction (NLDR) find meaningful hidden low-dimensional structures in a high-dimensional space. Current algorithms for NLDR are Isomaps, Loc...
157
click to vote
NIPS
2004
15 years 5 months ago
2004
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...