367 search results - page 38 / 74 » Tight lower bounds for the online labeling problem |
COLT
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. We study the problem of learning partitions using equivalence constraints as input. This is a binary classification problem in the product space of pairs of datapoints. ...
MFCS
2009
Springer
14 years 4 days ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
INFOCOM
2003
IEEE
14 years 26 days ago
2003
IEEE
— Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineer...
WDAG
2001
Springer
14 years 16 hour ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
ALGORITHMICA
2010
13 years 7 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...