Sciweavers

528 search results - page 28 / 106
» Degrees of categoricity of computable structures
Sort
View
ICPR
2008
IEEE
14 years 3 months ago
Calibration of a structured light system by observing planar object from unknown viewpoints
— A calibration method for a structured light system by observing a planar object from unknown viewpoints is proposed. A structured light system captures a 3D shape by a camera t...
Koichiro Yamauchi, Hideo Saito, Yukio Sato
JSC
2000
68views more  JSC 2000»
13 years 8 months ago
New Structure Theorem for Subresultants
We give a new structure theorem for subresultants precising their gap structure and derive from it a new algorithm for computing them. If d is a bound on the degrees and a bound o...
Henri Lombardi, Marie-Françoise Roy, Mohab ...
ECCV
1994
Springer
14 years 10 months ago
Visual Tracking of High DOF Articulated Structures: an Application to Human Hand Tracking
Passive sensing of human hand and limb motion is important for a wide range of applications from human-computer interaction to athletic performance measurement. High degree of free...
James M. Rehg, Takeo Kanade
APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
13 years 3 months ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
MFCS
2005
Springer
14 years 2 months ago
Canonical Disjoint NP-Pairs of Propositional Proof Systems
We prove that every disjoint NP-pair is polynomial-time, many-one equivalent to the canonical disjoint NP-pair of some propositional proof system. Therefore, the degree structure ...
Christian Glaßer, Alan L. Selman, Liyu Zhang