Sciweavers

2583 search results - page 287 / 517
» On the Representation of Timed Polyhedra
Sort
View
CONCUR
2000
Springer
15 years 10 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
ICCV
1995
IEEE
15 years 10 months ago
Estimating the Tensor of Curvature of a Surface from a Polyhedral Approximation
Estimating principal curvatures and principal directions of a surface from a polyhedral approximation with a large number of small faces, such as those produced by iso-surface con...
Gabriel Taubin
ICDAR
1995
IEEE
15 years 10 months ago
Handwritten word recognition for real-time applications
—A fast method of handwritten word recognition suitable for real time applications is presented in this paper. Preprocessing, segmentation and feature extraction are implemented ...
Gyeonghwan Kim, Venu Govindaraju
CEC
2009
IEEE
15 years 10 months ago
A simple multi-objective optimization algorithm for the urban transit routing problem
— The urban transit routing problem (UTRP) for public transport systems involves finding a set of efficient transit routes to meet customer demands. The UTRP is an NPHard, high...
Lang Fan, Christine L. Mumford, Dafydd Evans
ACMSE
2008
ACM
15 years 8 months ago
Mining frequent sequential patterns with first-occurrence forests
In this paper, a new pattern-growth algorithm is presented to mine frequent sequential patterns using First-Occurrence Forests (FOF). This algorithm uses a simple list of pointers...
Erich Allen Peterson, Peiyi Tang