Sciweavers

479 search results - page 60 / 96
» An Algebra of Pareto Points
Sort
View
ICCV
1999
IEEE
14 years 11 months ago
Euclidean Reconstruction and Reprojection up to Subgroups
The necessary and sufficient conditions for being able to estimate scene structure, motion and camera calibration from a sequence of images are very rarely satisfied in practice. ...
Yi Ma, Stefano Soatto, Jana Kosecka, Shankar Sastr...
ITC
1994
IEEE
151views Hardware» more  ITC 1994»
14 years 2 months ago
Automated Logic Synthesis of Random-Pattern-Testable Circuits
Previous approaches to designing random pattern testable circuits use post-synthesis test point insertion to eliminate random pattern resistant (r.p.r.) faults. The approach taken...
Nur A. Touba, Edward J. McCluskey
POPL
2009
ACM
14 years 4 months ago
Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures
With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Functional programming languages, such as Haskel...
Abdallah Al Zain, Kevin Hammond, Jost Berthold, Ph...
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
14 years 1 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
AIML
2004
13 years 11 months ago
On Notions of Completeness Weaker than Kripke Completeness
We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...
Tadeusz Litak