7015 search results - page 210 / 1403 » Approximation algorithms for co-clustering |
158
click to vote
DISOPT
2010
15 years 6 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
162
click to vote
ICTCS
2005
Springer
16 years 44 min ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
145
click to vote
CAD
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents geometric algorithms for developing a re-configurable tooling system for fabrication of freeform objects. The proposed method involves a mold block, with n fac...
178
click to vote
MP
1998
15 years 6 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
167
click to vote
COCOON
2010
Springer
15 years 11 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...