31 search results - page 2 / 7 » cocoon 2007 |
COCOON
2007
Springer
13 years 12 months ago
2007
Springer
We use the connection between resource-bounded dimension and the online mistake-bound model of learning to show that the following classes have polynomial-time dimension zero.
COCOON
2007
Springer
13 years 12 months ago
2007
Springer
We provide three key missing pieces of a general theory of information distance [3, 23, 24]. We take bold steps in formulating a revised theory to avoid some pitfalls in practical...
COCOON
2007
Springer
13 years 12 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
COCOON
2007
Springer
13 years 12 months ago
2007
Springer
We formalize the definition of symmetric auctions to study fundamental properties of incentive compatible auction protocols. We characterize such auction protocols for those with ...
COCOON
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.