Sciweavers

281 search results - page 14 / 57
» The Complexity of Planar Counting Problems
Sort
View
ICPR
2000
IEEE
14 years 4 days ago
Self-Calibration of Zooming Cameras Observing an Unknown Planar Structure
In this paper, we propose a new self-calibration technique for cameras with changing zoom observing only a planar structure. The method does not need any metric or topologic knowl...
Ezio Malis, Roberto Cipolla
IPPS
2007
IEEE
14 years 2 months ago
Probability Convergence in a Multithreaded Counting Application
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
Chad Scherrer, Nathaniel Beagley, Jarek Nieplocha,...
CPC
2000
93views more  CPC 2000»
13 years 7 months ago
Fast Unimodular Counting
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral ve...
John Mount
ICRA
2006
IEEE
93views Robotics» more  ICRA 2006»
14 years 1 months ago
Motion Planning for a Class of Planar Closed-chain Manipulators
— We study the motion planning problem for planar star-shaped manipulators. These manipulators are formed by joining k “legs” to a common point (like the thorax of an insect)...
Guanfeng Liu, Jeffrey C. Trinkle, N. Shvalb
FOSSACS
2010
Springer
14 years 2 months ago
Counting CTL
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
François Laroussinie, Antoine Meyer, Eudes ...