2421 search results - page 113 / 485 » Approximate Flow-Aware Networking |
143
click to vote
SEC
1996
15 years 4 months ago
1996
This paper introduces and describes an innovative modelling approach which utilises models that are synthesised through approximate calculations of user actions and extensive repr...
119
click to vote
AI
2008
Springer
15 years 3 months ago
2008
Springer
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
111
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract-- Traditional distributed source coding rarely considers the possible link between separate encoders. However, the broadcast nature of wireless communication in sensor net...
146
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
112
click to vote
PODS
2006
ACM
16 years 3 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...