7015 search results - page 1372 / 1403 » Approximation algorithms for co-clustering |
162
Voted
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
153
Voted
ATAL
2003
Springer
15 years 10 months ago
2003
Springer
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
125
Voted
ATAL
2003
Springer
15 years 10 months ago
2003
Springer
Auctions are an important means for purchasing material in the era of e-commerce. Research on auctions often studies them in isolation. In practice, however, auction agents are pa...
136
click to vote
BIRTHDAY
2003
Springer
15 years 10 months ago
2003
Springer
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
115
click to vote
COCO
2003
Springer
15 years 10 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...