5595 search results - page 404 / 1119 » Approximation Algorithms for Clustering Problems |
251
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Real-world, multiple-typed objects are often interconnected, forming heterogeneous information networks. A major challenge for link-based clustering in such networks is its potent...
168
click to vote
ASIAMS
2008
IEEE
16 years 1 months ago
2008
IEEE
The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possibl...
215
click to vote
JMLR
2008
15 years 6 months ago
2008
We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the prob...
186
click to vote
SPAA
2003
ACM
16 years 2 days ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
195
click to vote
WAOA
2005
Springer
16 years 9 days ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...