Sciweavers

13706 search results - page 2636 / 2742
» Information Problems in Information Society
Sort
View
LPAR
2001
Springer
15 years 11 months ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...
LPAR
2001
Springer
15 years 11 months ago
Local Conditional High-Level Robot Programs
When it comes to building robot controllers, highlevel programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a lega...
Sebastian Sardiña
SSD
2001
Springer
128views Database» more  SSD 2001»
15 years 10 months ago
Creating Representations for Continuously Moving Regions from Observations
Recently there is much interest in moving objects databases, and data models and query languages have been proposed offering data types such as moving point and moving region toge...
Erlend Tøssebro, Ralf Hartmut Güting
WIA
2001
Springer
15 years 10 months ago
Finite-State Transducer Cascade to Extract Proper Names in Texts
This article describes a finite-state cascade for the extraction of person names in texts in French. We extract these proper names in order to categorize and to cluster texts with...
Nathalie Friburger, Denis Maurel
FOCS
2000
IEEE
15 years 10 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
« Prev « First page 2636 / 2742 Last » Next »