Sciweavers

1015 search results - page 62 / 203
» An efficient algorithm for AS path inferring
Sort
View
UAI
2001
13 years 9 months ago
Expectation Propagation for approximate Bayesian inference
This paper presents a new deterministic approximation technique in Bayesian networks. This method, "Expectation Propagation," unifies two previous techniques: assumed-de...
Thomas P. Minka
NETWORKING
2007
13 years 9 months ago
Maximum Energy Welfare Routing in Wireless Sensor Networks
Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the sensors on the efficient paths are ...
Changsoo Ok, Prasenjit Mitra, Seokcheon Lee, Sound...
JMLR
2010
151views more  JMLR 2010»
13 years 2 months ago
The Feature Selection Path in Kernel Methods
The problem of automatic feature selection/weighting in kernel methods is examined. We work on a formulation that optimizes both the weights of features and the parameters of the ...
Fuxin Li, Cristian Sminchisescu
BMCBI
2005
169views more  BMCBI 2005»
13 years 8 months ago
Genetic interaction motif finding by expectation maximization - a novel statistical model for inferring gene modules from synthe
Background: Synthetic lethality experiments identify pairs of genes with complementary function. More direct functional associations (for example greater probability of membership...
Yan Qi 0003, Ping Ye, Joel S. Bader
CLADE
2004
IEEE
13 years 12 months ago
An on Demand Path Marking and Capacity Reservation Method using Split Agent
Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. T...
Constandinos X. Mavromoustakis, Helen D. Karatza