Sciweavers

91 search results - page 12 / 19
» On value sets of polynomials over a field
Sort
View
ECCV
2008
Springer
14 years 9 months ago
Learning for Optical Flow Using Stochastic Optimization
Abstract. We present a technique for learning the parameters of a continuousstate Markov random field (MRF) model of optical flow, by minimizing the training loss for a set of grou...
Yunpeng Li, Daniel P. Huttenlocher
CSL
2010
Springer
13 years 8 months ago
Fibrational Induction Rules for Initial Algebras
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our res...
Neil Ghani, Patricia Johann, Clément Fumex
AI
2011
Springer
12 years 11 months ago
Finding Small Backdoors in SAT Instances
Although propositional satisfiability (SAT) is NP-complete, state-of-the-art SAT solvers are able to solve large, practical instances. The concept of backdoors has been introduced...
Zijie Li, Peter van Beek
ATVA
2007
Springer
87views Hardware» more  ATVA 2007»
14 years 1 months ago
Latticed Simulation Relations and Games
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
Orna Kupferman, Yoad Lustig
DATE
2006
IEEE
104views Hardware» more  DATE 2006»
14 years 1 months ago
Equivalence verification of arithmetic datapaths with multiple word-length operands
Abstract: This paper addresses the problem of equivalence verification of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have di...
Namrata Shekhar, Priyank Kalla, Florian Enescu