Sciweavers

5210 search results - page 419 / 1042
» Exact geometric computation
Sort
View
DAM
2006
172views more  DAM 2006»
15 years 6 months ago
A Branch-and-Cut algorithm for graph coloring
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
Isabel Méndez-Díaz, Paula Zabala
EOR
2006
104views more  EOR 2006»
15 years 6 months ago
A factor 1/2 approximation algorithm for two-stage stochastic matching problems
We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete. We give a factor 1 2 approximation algorithm and prove its ...
Nan Kong, Andrew J. Schaefer
IJON
2008
123views more  IJON 2008»
15 years 6 months ago
Bayesian estimation of time delays between unevenly sampled signals
A method for estimating time delays between signals that are irregularly sampled is presented. The approach is based on postulating a latent variable model from which the observed...
Markus Harva, Somak Raychaudhury
CORR
2007
Springer
135views Education» more  CORR 2007»
15 years 6 months ago
Automatically Restructuring Practice Guidelines using the GEM DTD
This paper describes a system capable of semi-automatically filling an XML template from free texts in the clinical domain (practice guidelines). The XML template includes semanti...
Amanda Bouffier, Thierry Poibeau
JMLR
2006
97views more  JMLR 2006»
15 years 6 months ago
Distance Patterns in Structural Similarity
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
Thomas Kämpke