Sciweavers

1355 search results - page 61 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
COLT
1994
Springer
13 years 11 months ago
An Optimal Parallel Algorithm for Learning DFA
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
José L. Balcázar, Josep Díaz,...
DEM
2001
Springer
247views GIS» more  DEM 2001»
14 years 6 days ago
Procedural Geometry for Real-Time Terrain Visualisation in Blueberry3D
A common concern of the real−time terrain visualisation of today is the lack of geometric detail, when the terrain model is studied close enough. This is primary not a problem of...
Mattias Widmark
DLT
2007
13 years 9 months ago
2-Visibly Pushdown Automata
Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations are driven by the input. In this paper, we consider VPA with two stacks, namely 2...
Dario Carotenuto, Aniello Murano, Adriano Peron
COMGEO
2008
ACM
13 years 7 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos
RTSS
2005
IEEE
14 years 1 months ago
Event Count Automata: A State-Based Model for Stream Processing Systems
Recently there has been a growing interest in models and methods targeted towards the (co)design of stream processing applications; e.g. those for audio/video processing. Streams ...
Samarjit Chakraborty, Linh T. X. Phan, P. S. Thiag...