Sciweavers

530 search results - page 28 / 106
» Bounds on marginal probability distributions
Sort
View
TIT
2011
106views more  TIT 2011»
13 years 2 months ago
Interference Alignment-Based Sum Capacity Bounds for Random Dense Gaussian Interference Networks
We consider a dense K user Gaussian interference network formed by paired transmitters and receivers placed independently at random in a fixed spatial region. Under natural condi...
Oliver Johnson, Matthew Aldridge, Robert J. Piecho...
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
14 years 1 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
INFOCOM
2007
IEEE
14 years 2 months ago
Performance Evaluation of Loss Networks via Factor Graphs and the Sum-Product Algorithm
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...
Jian Ni, Sekhar Tatikonda
AMAI
2004
Springer
14 years 1 months ago
Using the Central Limit Theorem for Belief Network Learning
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
Ian Davidson, Minoo Aminian
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
13 years 11 months ago
Sporadic model building for efficiency enhancement of hierarchical BOA
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...
Martin Pelikan, Kumara Sastry, David E. Goldberg