Sciweavers

165 search results - page 10 / 33
» NIPS workshop on New Problems and Methods in Computational B...
Sort
View
INFORMS
2010
147views more  INFORMS 2010»
13 years 5 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
RECOMB
2006
Springer
14 years 8 months ago
Sorting by Translocations Via Reversals Theory
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
Michal Ozery-Flato, Ron Shamir
NIPS
2007
13 years 9 months 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
JSSPP
2005
Springer
14 years 1 months ago
An Extended Evaluation of Two-Phase Scheduling Methods for Animation Rendering
Recently HP Labs engaged in a joint project with DreamWorks Animation to develop a Utility Rendering Service that was used to render part of the computer-animated feature film Shr...
Yunhong Zhou, Terence Kelly, Janet L. Wiener, Eric...
BMCBI
2008
122views more  BMCBI 2008»
13 years 8 months ago
Reconstructing networks of pathways via significance analysis of their intersections
Background: Significance analysis at single gene level may suffer from the limited number of samples and experimental noise that can severely limit the power of the chosen statist...
Mirko Francesconi, Daniel Remondini, Nicola Nerett...