Sciweavers

505 search results - page 5 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
SC
2003
ACM
14 years 1 months ago
Multi-Constraint Mesh Partitioning for Contact/Impact Computations
We present a novel approach for decomposing contact/impact computations in which the mesh elements come in contact with each other during the course of the simulation. Effective d...
George Karypis
ICML
2009
IEEE
14 years 9 months ago
Structure learning of Bayesian networks using constraints
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
Cassio Polpo de Campos, Zhi Zeng, Qiang Ji
ICC
2008
IEEE
142views Communications» more  ICC 2008»
14 years 2 months ago
End-to-End Outage Probability Minimization in OFDM Based Linear Multi-Hop Networks
Abstract— This paper is concerned with the end-to-end transmission outage in an OFDM based wireless multi-hop network. The network consists of a source node, a destination node, ...
Xiaolu Zhang, Meixia Tao, Wenhua Jiao, Chun Sum Ng
ICC
2009
IEEE
135views Communications» more  ICC 2009»
14 years 3 months ago
Completion Time Minimization and Robust Power Control in Wireless Packet Networks
A wireless packet network is considered in which each user transmits a stream of packets to its destination. The transmit power of each user interferes with the transmission of al...
Chris T. K. Ng, Muriel Médard, Asuman E. Oz...
BMCBI
2010
178views more  BMCBI 2010»
13 years 8 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...