Sciweavers

614 search results - page 14 / 123
» Probabilistic Arc Consistency
Sort
View
JAIR
2011
124views more  JAIR 2011»
13 years 2 months ago
Second-Order Consistencies
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build ...
Christophe Lecoutre, Stéphane Cardon, Julie...
CP
2001
Springer
14 years 2 days ago
Solving Non-binary CSPs Using the Hidden Variable Encoding
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
Nikos Mamoulis, Kostas Stergiou
ARCS
2004
Springer
14 years 29 days ago
Heterogenous Data Fusion via a Probabilistic Latent-Variable Model
In a pervasive computing environment, one is facing the problem of handling heterogeneous data from different sources, transmitted over heterogeneous channels and presented on het...
Kai Yu, Volker Tresp
MM
1996
ACM
150views Multimedia» more  MM 1996»
13 years 11 months ago
Adaptive Rate-Controlled Scheduling for Multimedia Applications
We present a framework for integrated scheduling of continuous media (CM) and other applications. The framework, called ARC scheduling, consists of a rate-controlled on-line CPU sc...
David K. Y. Yau, Simon S. Lam
TAL
2004
Springer
14 years 27 days ago
Expressive Power and Consistency Properties of State-of-the-Art Natural Language Parsers
Abstract. We define Probabilistic Constrained W-grammars (PCWgrammars), a two-level formalism capable of capturing grammatical frameworks used in two state of the art parsers, nam...
Gabriel G. Infante López, Maarten de Rijke