Sciweavers

148 search results - page 12 / 30
» A structural property of solutions to path optimization prob...
Sort
View
ECCC
2006
88views more  ECCC 2006»
13 years 7 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna
BIOINFORMATICS
2007
151views more  BIOINFORMATICS 2007»
13 years 8 months ago
A new protein-protein docking scoring function based on interface residue properties
Motivation: Protein–protein complexes are known to play key roles in many cellular processes. However, they are often not accessible to experimental study because of their low s...
Julie Bernauer, Jérôme Azé, Jo...
CCE
2005
13 years 7 months ago
Logic-based outer approximation for globally optimal synthesis of process networks
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
María Lorena Bergamini, Pío A. Aguir...
STACS
2005
Springer
14 years 1 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
EMNLP
2008
13 years 9 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney