7930 search results - page 1170 / 1586 » Greedy in Approximation Algorithms |
191
click to vote
NIPS
2008
15 years 8 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
191
click to vote
NIPS
2008
15 years 8 months ago
2008
This paper introduces a new approach to constructing meaningful lower dimensional representations of sets of data points. We argue that constraining the mapping between the high a...
200
click to vote
NIPS
2008
15 years 8 months ago
2008
Recently, supervised dimensionality reduction has been gaining attention, owing to the realization that data labels are often available and indicate important underlying structure...
173
click to vote
NIPS
2008
15 years 8 months ago
2008
In partially observable worlds with many agents, nested beliefs are formed when agents simultaneously reason about the unknown state of the world and the beliefs of the other agen...
197
click to vote
NIPS
2008
15 years 8 months ago
2008
Many nonlinear dynamical phenomena can be effectively modeled by a system that switches among a set of conditionally linear dynamical modes. We consider two such models: the switc...