Sciweavers

224 search results - page 4 / 45
» Three New Algorithms for Regular Language Enumeration
Sort
View
CP
2005
Springer
15 years 3 months ago
Mind the Gaps: A New Splitting Strategy for Consistency Techniques
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
Heikel Batnini, Claude Michel, Michel Rueher
HYBRID
1998
Springer
15 years 1 months ago
Equations on Timed Languages
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
Eugene Asarin
FCSC
2010
108views more  FCSC 2010»
14 years 8 months ago
On the computation of quotients and factors of regular languages
Quotients and factors are important notions in the design of various computational procedures for regular languages and for the analysis of their logical properties. We propose a n...
Mircea Marin, Temur Kutsia
ISMB
2000
14 years 10 months ago
Search for a New Description of Protein Topology and Local Structure
A novel description of protein structure in terms of the generalized secondary structure elements (GSSE) is proposed. GSSE's are defined as fragments of the protein structure...
Lukasz Jaroszewski, Adam Godzik
ACL
2007
14 years 11 months ago
A Comparative Study of Parameter Estimation Methods for Statistical Natural Language Processing
This paper presents a comparative study of five parameter estimation algorithms on four NLP tasks. Three of the five algorithms are well-known in the computational linguistics com...
Jianfeng Gao, Galen Andrew, Mark Johnson, Kristina...