2487 search results - page 416 / 498 » Partitions of Graphs into Trees |
DMSN
2004
ACM
14 years 1 months ago
2004
ACM
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
SIGECOM
2004
ACM
14 years 1 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
CINQ
2004
Springer
14 years 1 months ago
2004
Springer
Frequent Pattern Mining (FPM) is a very powerful paradigm for mining informative and useful patterns in massive, complex datasets. In this paper we propose the Data Mining Templat...
KES
2004
Springer
14 years 1 months ago
2004
Springer
Many different approaches for content-based image retrieval have been proposed in the literature. Successful approaches consider not only simple features like color, but also take ...
CW
2003
IEEE
14 years 1 months ago
2003
IEEE
The paper presents an interesting study that how the user surfing behavior with respect to the organization of a web space affects the performance of a prefetch enabled proxy. We ...