Sciweavers

1480 search results - page 147 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
15 years 23 days 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...
ICML
2004
IEEE
16 years 1 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu
IPPS
2010
IEEE
14 years 10 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart
EGC
2005
Springer
15 years 6 months ago
Rapid Distribution of Tasks on a Commodity Grid
The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates the management...
Ladislau Bölöni, Damla Turgut, Taskin Ko...
IPPS
2003
IEEE
15 years 6 months ago
Mesh Partitioning: A Multilevel Ant-Colony-Optimization Algorithm
Mesh partitioning is an important problem that has extensive applications in many areas. Multilevel algorithms are a successful class of optimization techniques which addresses th...
Peter Korosec, Jurij Silc, Borut Robic