2465 search results - page 194 / 493 » Automata on Linear Orderings |
LICS
2009
IEEE
14 years 5 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
IEEESCC
2005
IEEE
14 years 4 months ago
2005
IEEE
Web service discovery is a key problem as the number of services is expected to increase dramatically. Service discovery at the present time is based primarily on keywords, or int...
FOIKS
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
CSL
2008
Springer
14 years 13 days ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
SDL
2001
14 years 22 hour ago
2001
In this paper we propose some extensions necessary to enable the speci cation and description language SDL to become an appropriate formalism for the design of real-time and embedd...