Sciweavers

1503 search results - page 45 / 301
» Self-optimizing distributed trees
Sort
View
ALGOSENSORS
2009
Springer
13 years 7 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
UAI
2001
13 years 11 months ago
Maximum Likelihood Bounded Tree-Width Markov Networks
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
Nathan Srebro
IJAIT
2002
82views more  IJAIT 2002»
13 years 9 months ago
Interleaved Backtracking in Distributed Constraint Networks
The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the ...
Youssef Hamadi
ICASSP
2011
IEEE
13 years 1 months ago
Optimal structure of memory models for lossless compression of binary image contours
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
Ioan Tabus, Septimia Sarbu