4137 search results - page 488 / 828 » On the number of matchings of a tree |
171
click to vote
DMSN
2004
ACM
16 years 8 days 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...
172
click to vote
SIGECOM
2004
ACM
16 years 8 days 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...
174
click to vote
APPROX
2004
Springer
16 years 7 days ago
2004
Springer
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
173
click to vote
ECCV
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. We propose a new scheme for novelty detection in image sequences capable of handling non-stationary background scenarious, such as waving trees, rain and snow. Novelty de...
180
click to vote
GC
2004
Springer
16 years 6 days ago
2004
Springer
Structured peer-to-peer overlay networks have recently emerged as good candidate infrastructure for building novel large-scale and robust Internet applications in which participat...