Sciweavers

2031 search results - page 217 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
NIPS
2007
15 years 10 days ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
88
Voted
WSC
2004
15 years 8 days ago
Building Credible Input Models
Most discrete-event simulation models have stochastic elements that mimic the probabilistic nature of the system under consideration. A close match between the input model and the...
Lawrence Leemis
RECOMB
2006
Springer
15 years 11 months ago
Assessing Significance of Connectivity and Conservation in Protein Interaction Networks
Computational and comparative analysis of protein-protein interaction (PPI) networks enable understanding of the modular organization of the cell through identification of functio...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
124
Voted
RECOMB
2004
Springer
15 years 11 months ago
Comparing in situ mRNA expression patterns of drosophila embryos
In situ staining of a target mRNA at several time points during the development of a D. melanogaster embryo gives one a detailed spatio-temporal view of the expression pattern of ...
Hanchuan Peng, Eugene W. Myers
85
Voted
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
15 years 3 months ago
Truthful assignment without money
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
Shaddin Dughmi, Arpita Ghosh