Sciweavers

762 search results - page 29 / 153
» Intercode Regular Languages
Sort
View
LICS
2012
IEEE
13 years 4 months ago
Graph Logics with Rational Relations and the Generalized Intersection Problem
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
Pablo Barceló, Diego Figueira, Leonid Libki...
EMNLP
2011
14 years 2 months ago
Structured Sparsity in Structured Prediction
Linear models have enjoyed great success in structured prediction in NLP. While a lot of progress has been made on efficient training with several loss functions, the problem of ...
André F. T. Martins, Noah A. Smith, M&aacut...
JUCS
2002
119views more  JUCS 2002»
15 years 1 months ago
Error-Correction, and Finite-Delay Decodability
: When the words of a language are communicated via a noisy channel, the language property of error-detection ensures that no word of the language can be transformed to another wor...
Stavros Konstantinidis
93
Voted
PPDP
2001
Springer
15 years 6 months ago
Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
Franklyn A. Turbak, J. B. Wells
117
Voted
ICFP
2010
ACM
15 years 3 months ago
Regular, shape-polymorphic, parallel arrays in Haskell
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
Gabriele Keller, Manuel M. T. Chakravarty, Roman L...