Sciweavers

103 search results - page 11 / 21
» EDNA: Estimation of Dependency Networks Algorithm
Sort
View
ISCA
2009
IEEE
186views Hardware» more  ISCA 2009»
15 years 8 months ago
Application-aware deadlock-free oblivious routing
Conventional oblivious routing algorithms are either not application-aware or assume that each flow has its own private channel to ensure deadlock avoidance. We present a framewo...
Michel A. Kinsy, Myong Hyon Cho, Tina Wen, G. Edwa...
NIPS
2007
15 years 3 months ago
Learning with Tree-Averaged Densities and Distributions
We utilize the ensemble of trees framework, a tractable mixture over superexponential number of tree-structured distributions [1], to develop a new model for multivariate density ...
Sergey Kirshner
COMCOM
2010
179views more  COMCOM 2010»
15 years 2 months ago
On the statistical characterization of flows in Internet traffic with application to sampling
A new method of estimating some statistical characteristics of TCP flows in the Internet is developed in this paper. For this purpose, a new set of random variables (referred to as...
Yousra Chabchoub, Christine Fricker, Fabrice Guill...
AAAI
2007
15 years 4 months ago
Unscented Message Passing for Arbitrary Continuous Variables in Bayesian Networks
Since Bayesian network (BN) was introduced in the field of artificial intelligence in 1980s, a number of inference algorithms have been developed for probabilistic reasoning. Ho...
Wei Sun, Kuo-Chu Chang
120
Voted
FGIT
2009
Springer
15 years 8 months ago
AGILE Rate Control for IEEE 802.11 Networks
We present a transmission rate adaptation algorithm called AGILE (ACK-Guided Immediate Link rate Estimation) for IEEE 802.11 networks. The key idea of AGILE is that the transmitter...
Lochan Verma, Seongkwan Kim, Sunghyun Choi, Sung-J...