5595 search results - page 756 / 1119 » Approximation Algorithms for Clustering Problems |
168
click to vote
ENC
2005
IEEE
16 years 12 days ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
188
click to vote
STOC
2003
ACM
16 years 1 days ago
2003
ACM
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
205
click to vote
CVPR
2008
IEEE
15 years 8 months ago
2008
IEEE
In photometric stereo a robust method is required to deal with outliers, such as shadows and non-Lambertian reflections. In this paper we rely on a probabilistic imaging model tha...
200
click to vote
NIPS
2007
15 years 8 months ago
2007
Stability is a desirable characteristic for linear dynamical systems, but it is often ignored by algorithms that learn these systems from data. We propose a novel method for learn...
168
click to vote
JCO
1998
15 years 6 months ago
1998
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...