Sciweavers

55 search results - page 8 / 11
» Pomset Languages of Finite Step Transition Systems
Sort
View
LREC
2008
88views Education» more  LREC 2008»
13 years 9 months ago
A Trainable Tokenizer, solution for multilingual texts and compound expression tokenization
Tokenization is one of the initial steps done for almost any text processing task. It is not particularly recognized as a challenging task for English monolingual systems but it r...
Oana Frunza
SAC
2006
ACM
13 years 7 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
FOSSACS
2010
Springer
13 years 10 months ago
Degrees of Lookahead in Regular Infinite Games
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a f...
Michael Holtmann, Lukasz Kaiser, Wolfgang Thomas
EDBTW
2006
Springer
13 years 11 months ago
Window Specification over Data Streams
Several query languages have been proposed for managing data streams in modern monitoring applications. Continuous queries expressed in these languages usually employ windowing con...
Kostas Patroumpas, Timos K. Sellis
ATAL
2006
Springer
13 years 11 months ago
Verifying space and time requirements for resource-bounded agents
The effective reasoning capability of an agent can be defined as its capability to infer, within a given space and time bound, facts that are logical consequences of its knowledge...
Natasha Alechina, Mark Jago, Piergiorgio Bertoli, ...