Sciweavers

48 search results - page 6 / 10
» Deducibility Constraints
Sort
View
CP
2010
Springer
13 years 6 months ago
Local Consistency and SAT-Solvers
In this paper we show that the power of using k-consistency techniques in a constraint problem is precisely captured by using a particular inference rule, which we call positive-hy...
Justyna Petke, Peter Jeavons
ICCV
2005
IEEE
14 years 1 months ago
Non-Negative Lighting and Specular Object Recognition
Recognition of specular objects is particularly difficult because their appearance is much more sensitive to lighting changes than that of Lambertian objects. We consider an appr...
Sameer Shirdhonkar, David W. Jacobs
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 2 months ago
Concavity of Mutual Information Rate for Input-Restricted Finite-State Memoryless Channels at High SNR
We consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavio...
Guangyue Han, Brian H. Marcus
BMCBI
2005
137views more  BMCBI 2005»
13 years 7 months ago
A configuration space of homologous proteins conserving mutual information and allowing a phylogeny inference based on pair-wise
Background: Popular methods to reconstruct molecular phylogenies are based on multiple sequence alignments, in which addition or removal of data may change the resulting tree topo...
Olivier Bastien, Philippe Ortet, Sylvaine Roy, Eri...
CP
2007
Springer
14 years 1 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...