Sciweavers

615 search results - page 32 / 123
» Beta Reduction Constraints
Sort
View
ICALP
2007
Springer
14 years 5 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
ICPR
2010
IEEE
13 years 8 months ago
Semi-supervised Graph Learning: Near Strangers or Distant Relatives
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...
Weifu Chen, Guocan Feng
AVSS
2008
IEEE
14 years 5 months ago
Shadow Removal in Indoor Scenes
In this paper, we propose a shadow removal algorithm for indoor scenes. This algorithm uses three types of constraints: chromaticity consistency, texture consistency and range of ...
Anh-Tuan Nghiem, François Brémond, M...
ICML
2006
IEEE
14 years 11 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
ASPDAC
2006
ACM
117views Hardware» more  ASPDAC 2006»
14 years 4 months ago
Signal-path driven partition and placement for analog circuit
This paper advances a new methodology based on signal-path information to resolve the problem of device-level placement for analog layout. This methodology is mainly based on three...
Di Long, Xianlong Hong, Sheqin Dong