1029 search results - page 6 / 206 » Local Minima Embedding |
123
click to vote
NIPS
1997
15 years 3 months ago
1997
Nonlinear dimensionality reduction is formulated here as the problem of trying to find a Euclidean feature-space embedding of a set of observations that preserves as closely as p...
115
click to vote
VLSID
2002
IEEE
16 years 2 months ago
2002
IEEE
In this paper, we present a functional partitioning method for low power real-time distributed embedded systems whose constituent nodes are systems-on-a-chip (SOCs). The systemlev...
106
click to vote
SAT
2005
Springer
15 years 7 months ago
2005
Springer
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
103
click to vote
ICDM
2003
IEEE
15 years 7 months ago
2003
IEEE
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
102
Voted
MOR
2006
15 years 1 months ago
2006
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...