Sciweavers

2421 search results - page 32 / 485
» Approximate Flow-Aware Networking
Sort
View
WAOA
2010
Springer
264views Algorithms» more  WAOA 2010»
14 years 7 months ago
An FPTAS for Flows over Time with Aggregate Arc Capacities
We study flows over time in networks with transit times on the arcs. Transit times describe how long it takes to traverse an arc. A flow over time specifies for each arc a time-dep...
Daniel Dressler, Martin Skutella
IJPRAI
1998
100views more  IJPRAI 1998»
14 years 9 months ago
Obtaining The Correspondence between Bayesian and Neural Networks
We present in this paper a novel method for eliciting the conditional probability matrices needed for a Bayesian network with the help of a neural network. We demonstrate how we c...
Athena Stassopoulou, Maria Petrou
WIOPT
2011
IEEE
14 years 1 months ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...
JMLR
2012
13 years 8 days ago
Detecting Network Cliques with Radon Basis Pursuit
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
Xiaoye Jiang, Yuan Yao, Han Liu, Leonidas J. Guiba...
ICIP
2003
IEEE
15 years 11 months ago
Approximation of color characterization MLUTS with artificial neural networks
MLUTs used in color characterization require significant memory for embedded systems. Most tools that create device characterization maps, use MLUTs. For this reason, there is int...
Michael J. Vrhel