Sciweavers

89 search results - page 3 / 18
» CP Models for Maximum Common Subgraph Problems
Sort
View
CSCLP
2007
Springer
14 years 2 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
CP
2007
Springer
14 years 2 months ago
Uncertainty in Bipolar Preference Problems
Preferences and uncertainty are common in many real-life problems. In this paper, we focus on bipolar preferences and on uncertainty modelled via uncontrollable variables. However,...
Stefano Bistarelli, Maria Silvia Pini, Francesca R...
BIRD
2007
Springer
120views Bioinformatics» more  BIRD 2007»
14 years 2 months ago
Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
Brijnesh J. Jain, Michael Lappe
TSP
2008
179views more  TSP 2008»
13 years 8 months ago
Estimation in Gaussian Graphical Models Using Tractable Subgraphs: A Walk-Sum Analysis
Graphical models provide a powerful formalism for statistical signal processing. Due to their sophisticated modeling capabilities, they have found applications in a variety of fie...
V. Chandrasekaran, Jason K. Johnson, Alan S. Wills...
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
14 years 1 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao