Sciweavers

834 search results - page 83 / 167
» Computing Minimal Models, Stable Models, and Answer Sets
Sort
View
ICIP
2007
IEEE
16 years 1 months ago
Fundamental Matrix Estimation Without Prior Match
This paper presents a probabilistic framework for computing correspondences and fundamental matrix in the structure from motion problem. Inspired by Moisan and Stival [1], we sugg...
Frédéric Sur, Marie-Odile Berger, Ni...
CORR
2010
Springer
138views Education» more  CORR 2010»
14 years 12 months ago
Optimal Path Planning under Temporal Logic Constraints
Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
Stephen L. Smith, Jana Tumova, Calin Belta, Daniel...
ENTCS
2002
139views more  ENTCS 2002»
14 years 11 months ago
Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
Conrado Daws, Marta Z. Kwiatkowska, Gethin Norman
CF
2010
ACM
15 years 5 months ago
Interval-based models for run-time DVFS orchestration in superscalar processors
We develop two simple interval-based models for dynamic superscalar processors. These models allow us to: i) predict with great accuracy performance and power consumption under va...
Georgios Keramidas, Vasileios Spiliopoulos, Stefan...
ICCV
2011
IEEE
13 years 12 months ago
Face Reconstruction in the Wild
We address the problem of reconstructing 3D face models from large unstructured photo collections, e.g., obtained by Google image search or from personal photo collections in iPho...
Ira Kemelmacher-Shlizerman, Steven Seitz