Sciweavers

2944 search results - page 198 / 589
» Improving Bound Propagation
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
14 years 2 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
CVPR
2008
IEEE
16 years 8 months ago
Detection with multi-exit asymmetric boosting
We introduce a generalized representation for a boosted classifier with multiple exit nodes, and propose a method to training which combines the idea of propagating scores across ...
Minh-Tri Pham, V-D. D. Hoang, Tat-Jen Cham
INFOCOM
2005
IEEE
16 years 3 days ago
Non-uniform random membership management in peer-to-peer networks
Abstract— Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would beneï¬...
Ming Zhong, Kai Shen, Joel I. Seiferas
INFOCOM
1996
IEEE
15 years 10 months ago
Integrated Control of Connection Admission, Flow Rate, and Bandwidth for ATM Based Networks
: We consider the combined control problem of connection admission, flow rate, and bandwidth allocation (capacity, service-rate) under nonstationary conditions. A fluid flow model ...
Andreas Pitsillides, Petros A. Ioannou, David Tipp...
WIOPT
2010
IEEE
15 years 4 months ago
Delay efficient scheduling via redundant constraints in multihop networks
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
Longbo Huang, Michael J. Neely