Sciweavers

35 search results - page 5 / 7
» Succinct Representations of Dynamic Strings
Sort
View
SPIRE
2000
Springer
13 years 11 months ago
Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...
Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, ...
ICML
2006
IEEE
14 years 8 months ago
Efficient inference on sequence segmentation models
Sequence segmentation is a flexible and highly accurate mechanism for modeling several applications. Inference on segmentation models involves dynamic programming computations tha...
Sunita Sarawagi
EACL
1993
ACL Anthology
13 years 8 months ago
A Strategy for Dynamic Interpretation: a Fragment and an Implementation
The strategy for natural language interpretation presented in this paper implements the dynamics of context change by translating natural language texts into a meaning representat...
Olivier Bouchez, Jan van Eijck, Olivier Istace
RECOMB
2009
Springer
14 years 8 months ago
An Online Approach for Mining Collective Behaviors from Molecular Dynamics Simulations
Collective behavior involving distally separate regions in a protein is known to widely affect its function. In this paper, we present an online approach to study and characterize ...
Arvind Ramanathan, Pratul K. Agarwal, Maria Kurnik...
BXML
2003
13 years 8 months ago
An Instructional Component for Dynamic Course Generation and Delivery
: E-Learning offers the advantage of interactivity: an E-Learning system can adapt the learning materials to suit the learner’s personality and his goals, and it can react to the...
Carsten Ullrich