1399 search results - page 51 / 280 » Multi-party Finite Computations |
147
Voted
CONEXT
2007
ACM
15 years 7 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
107
Voted
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
118
Voted
SOFSEM
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. We examine the problem of finite-state representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularit...
125
Voted
COLING
1994
15 years 5 months ago
1994
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
131
Voted
LATIN
1998
Springer
15 years 8 months ago
1998
Springer
The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algor...