Sciweavers

8094 search results - page 337 / 1619
» Improvements in Formula Generalization
Sort
View
ICCV
2003
IEEE
16 years 8 months ago
A New Perspective [on] Shape-from-Shading
Shape-from-Shading (SfS) is a fundamental problem in Computer Vision. The vast majority of research in this field have assumed orthography as its projection model. This paper re-e...
Ariel Tankus, Nir A. Sochen, Yehezkel Yeshurun
290
Voted
POPL
2007
ACM
16 years 6 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
VMCAI
2010
Springer
16 years 3 months ago
Advances in Probabilistic Model Checking
In the recent years, there have been a large amount of investigations on safety verification of uncertain continuous systems. In engineering and applied mathematics, this verificat...
Joost-Pieter Katoen
ICCAD
2004
IEEE
107views Hardware» more  ICCAD 2004»
16 years 3 months ago
Computation of signal threshold crossing times directly from higher order moments
—This paper introduces a simple method for calculating the times at which any signal crosses a prespecified threshold voltage (e.g., 10%, 20%, 50%, etc.) directly from the moment...
Yehea I. Ismail, Chirayu S. Amin
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
16 years 3 months ago
Partition-Based Decision Heuristics for Image Computation Using SAT and BDDs
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
Aarti Gupta, Zijiang Yang, Pranav Ashar, Lintao Zh...