Sciweavers

759 search results - page 68 / 152
» Overlap-Free Regular Languages
Sort
View
ACL
2001
14 years 11 months ago
Text Chunking using Regularized Winnow
Many machine learning methods have recently been applied to natural language processing tasks. Among them, the Winnow algorithm has been argued to be particularly suitable for NLP...
Tong Zhang, Fred Damerau, David Johnson
FCT
2009
Springer
15 years 1 months ago
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...
Paul Hänsch, Michaela Slaats, Wolfgang Thomas
NJC
2006
102views more  NJC 2006»
14 years 9 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
AOSD
2010
ACM
15 years 4 months ago
Disambiguating aspect-oriented security policies
Many software security policies can be encoded as aspects that identify and guard security-relevant program operations. Bugs in these aspectually-implemented security policies oft...
Micah Jones, Kevin W. Hamlen
SIGADA
2005
Springer
15 years 3 months ago
The implementation of ada 2005 synchronized interfaces in the GNAT compiler
One of the most important object-oriented features of the new revision of the Ada Programming Language is the introof Abstract Interfaces to provide a form of multiple nce. Ada 20...
Javier Miranda, Edmond Schonberg, Hristian Kirtche...