Sciweavers

182 search results - page 28 / 37
» Simple Generalized Maximum Flow Algorithms
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 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...
FOCS
2009
IEEE
14 years 2 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
ATAL
2006
Springer
13 years 11 months ago
Multi-robot learning with particle swarm optimization
We apply an adapted version of Particle Swarm Optimization to distributed unsupervised robotic learning in groups of robots with only local information. The performance of the lea...
Jim Pugh, Alcherio Martinoli
PRL
2011
12 years 10 months ago
Structural matching of 2D electrophoresis gels using deformed graphs
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...
SLIP
2009
ACM
14 years 2 months ago
Predicting the worst-case voltage violation in a 3D power network
This paper proposes an efficient method to predict the worst case of voltage violation by multi-domain clock gating in a three-dimensional (3D) on-chip power network considering l...
Wanping Zhang, Wenjian Yu, Xiang Hu, Amirali Shaya...