Sciweavers

99 search results - page 14 / 20
» Inspection by Implicit Polynomials
Sort
View
AAAI
1994
14 years 11 months ago
Tractable Planning with State Variables by Exploiting Structural Restrictions
So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is ...
Peter Jonsson, Christer Bäckström
JAR
2006
97views more  JAR 2006»
14 years 9 months ago
Decidability Issues for Extended Ping-Pong Protocols
We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we sho...
Hans Hüttel, Jirí Srba
PRL
2007
163views more  PRL 2007»
14 years 9 months ago
A model based approach for pose estimation and rotation invariant object matching
Pose estimation has been considered to be an important component in many pattern recognition and computer vision systems. In this paper, we introduce a pose estimation method base...
Cem Ünsalan
MICS
2010
107views more  MICS 2010»
14 years 8 months ago
The Newton Polygon of a Rational Plane Curve
The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoret...
Carlos D'Andrea, Martín Sombra
POPL
2006
ACM
15 years 10 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer