10447 search results - page 2001 / 2090 » The Philosophy of Computer Science |
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
116
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
136
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
112
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi [CMY08] to initiate a formal study of the communication cost of certain fu...