5595 search results - page 905 / 1119 » Approximation Algorithms for Clustering Problems |
177
click to vote
NIPS
2008
15 years 7 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...
163
click to vote
AAAI
1990
15 years 7 months ago
1990
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
156
click to vote
CGF
2008
15 years 6 months ago
2008
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
171
click to vote
DEDS
2010
15 years 6 months ago
2010
Abstract-- We address the problem of batching messages generated at nodes of a sensor network for the purpose of reducing communication energy at the expense of added latency. We f...
148
Voted
CONSTRAINTS
2007
15 years 6 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...