10271 search results - page 1711 / 2055 » Computer Science |
166
click to vote
ICTCS
2005
Springer
16 years 6 days 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...
190
click to vote
MFCS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
173
click to vote
MFCS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Given a distance matrix M that specifies the pairwise evolutionary distances between n species, the phylogenetic tree reconstruction problem asks for an edge-weighted ph...
161
click to vote
MFCS
2005
Springer
16 years 5 days ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
153
click to vote
RELMICS
2005
Springer
16 years 5 days ago
2005
Springer
In this paper we present some examples of relational correspondences for not necessarily distributive lattices with modal-like operators of possibility (normal and additive operato...