12519 search results - page 398 / 2504 » Approximation Problems Categories |
237
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
213
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
173
click to vote
ATAL
2003
Springer
16 years 6 hour ago
2003
Springer
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
167
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
A database view is a dynamic virtual table composed of the result set of a query, often executed over different underlying databases. The view maintenance problem concerns how a v...
179
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...