Sciweavers

516 search results - page 59 / 104
» Generalizing the Discrete Timed Automaton
Sort
View
IJCNN
2006
IEEE
14 years 4 months ago
A Monte Carlo Sequential Estimation for Point Process Optimum Filtering
— Adaptive filtering is normally utilized to estimate system states or outputs from continuous valued observations, and it is of limited use when the observations are discrete e...
Yiwen Wang 0002, António R. C. Paiva, Jose ...
COMPGEOM
1997
ACM
14 years 2 months ago
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
Giuseppe Liotta, Franco P. Preparata, Roberto Tama...
COMPGEOM
2007
ACM
14 years 1 months ago
On the hardness of minkowski addition and related operations
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
Hans Raj Tiwary
COMPGEOM
1995
ACM
14 years 1 months ago
Triangulations Intersect Nicely
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
Oswin Aichholzer, Franz Aurenhammer, Michael Tasch...
COMPGEOM
1995
ACM
14 years 1 months ago
Searching for the Kernel of a Polygon - A Competitive Strategy
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
Christian Icking, Rolf Klein