Sciweavers

2869 search results - page 314 / 574
» The Inference Problem: A Survey
Sort
View
ATVA
2007
Springer
77views Hardware» more  ATVA 2007»
16 years 1 months ago
Proving Termination of Tree Manipulating Programs
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tom&...
CCIA
2007
Springer
16 years 1 months ago
Semantic disambiguation of taxonomies
Polysemy is one of the most difficult problems when dealing with natural language resources. Consequently, automated ontology learning from textual sources (such as web resources) ...
David Sánchez, Antonio Moreno
CP
2007
Springer
16 years 1 months ago
Solution Counting Algorithms for Constraint-Centered Search Heuristics
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...
Alessandro Zanarini, Gilles Pesant
EMMCVPR
2007
Springer
16 years 1 months ago
Bayesian Order-Adaptive Clustering for Video Segmentation
Video segmentation requires the partitioning of a series of images into groups that are both spatially coherent and smooth along the time axis. We formulate segmentation as a Bayes...
Peter Orbanz, Samuel Braendle, Joachim M. Buhmann
AE
2005
Springer
16 years 29 days ago
Incorporating Knowledge of Secondary Structures in a L-System-Based Encoding for Protein Folding
An encoding scheme for protein folding on lattice models, inspired by parametric L-systems, was proposed. The encoding incorporates problem domain knowledge in the form of predesig...
Gabriela Ochoa, Gabi Escuela, Natalio Krasnogor