2475 search results - page 424 / 495 » On the accuracy of language trees |
ESA
1998
Springer
14 years 1 days ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
LICS
1997
IEEE
14 years 1 days ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
ISMIS
1997
Springer
13 years 12 months ago
1997
Springer
e about image features can be expressed as a hierarchical structure called a Type Abstraction Hierarchy (TAH). TAHs can be generated automatically by clustering algorithms based on...
TLCA
1997
Springer
13 years 12 months ago
1997
Springer
We present a game model for classical PCF, a nite version of PCF extended by a catch/throw mechanism. This model is build from E-dialogues, a kind of two-players game de ned by Lor...
REX
1993
13 years 12 months ago
1993
Abstract. Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling...