3020 search results - page 199 / 604 » Optimal partition trees |
185
click to vote
AINA
2008
IEEE
15 years 8 months ago
2008
IEEE
It is important to design an energy efficient data gathering tree structure for wireless sensor networks. As for the energy efficiency, network's overall energy consumption an...
278
click to vote
VLDB
2004
ACM
16 years 6 months ago
2004
ACM
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
177
click to vote
COMBINATORICA
2006
15 years 6 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
178
click to vote
KAIS
2006
15 years 6 months ago
2006
In order to index Web images, the whole associated texts are partitioned into a sequence of text blocks, then the local relevance of a term to the corresponding image is calculated...
174
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...