632 search results - page 106 / 127 » On the Approximability of the Steiner Tree Problem |
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...
CISS
2007
IEEE
13 years 11 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
CIAC
2010
Springer
13 years 11 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
APPML
2002
13 years 7 months ago
2002
In phylogenetic analysis, a standard problem is to approximate a given metric by an additive metric. Here it is shown that, given a metric D defined on some finite set X and a non...