Sciweavers

119 search results - page 21 / 24
» On finite alphabets and infinite bases
Sort
View
CSCLP
2008
Springer
13 years 11 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
CVPR
2009
IEEE
15 years 4 months ago
Let the Kernel Figure it Out; Principled Learning of Pre-processing for Kernel Classifiers
Most modern computer vision systems for high-level tasks, such as image classification, object recognition and segmentation, are based on learning algorithms that are able to se...
Peter V. Gehler, Sebastian Nowozin
GMP
2010
IEEE
214views Solid Modeling» more  GMP 2010»
14 years 2 months ago
Efficient Computation of 3D Clipped Voronoi Diagram
The Voronoi diagram is a fundamental geometry structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact 3D d...
Dong-Ming Yan, Wenping Wang, Bruno Lévy, Ya...
ESCIENCE
2006
IEEE
14 years 1 months ago
Designing Workflow Components for e-Science
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
Frank Terpstra, Pieter W. Adriaans
IJFCS
2008
130views more  IJFCS 2008»
13 years 9 months ago
Equivalence of Labeled Markov Chains
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
Laurent Doyen, Thomas A. Henzinger, Jean-Fran&cced...