5595 search results - page 806 / 1119 » Approximation Algorithms for Clustering Problems |
168
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
In this paper we propose a novel, scalable, clustering based Ordinal Regression formulation, which is an instance of a Second Order Cone Program (SOCP) with one Second Order Cone ...
225
click to vote
VLDB
2000
ACM
15 years 10 months ago
2000
ACM
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
207
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
191
click to vote
SIGGRAPH
1992
ACM
15 years 10 months ago
1992
ACM
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
205
click to vote
MP
2007
15 years 6 months ago
2007
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...