5595 search results - page 428 / 1119 » Approximation Algorithms for Clustering Problems |
217
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...
175
click to vote
EDBT
2008
ACM
16 years 7 months ago
2008
ACM
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
176
click to vote
FOCM
2011
15 years 1 months ago
2011
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
198
click to vote
SIGMOD
2002
ACM
16 years 7 months ago
2002
ACM
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
179
click to vote
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance f...