10901 search results - page 326 / 2181 » Approximations in Distributed Optimization |
326
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
179
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
204
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
203
Voted
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
193
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
In this paper, we presentan approach to clustering images for efficient retrieval using relative entropy. We start with the assumption that visual features are represented by prob...