Sciweavers

84 search results - page 12 / 17
» Efficient Enumeration of Regular Languages
Sort
View
IFIP
2004
Springer
14 years 1 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
CAV
2007
Springer
164views Hardware» more  CAV 2007»
14 years 13 days ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
ISMB
2000
13 years 9 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
JAIR
2008
103views more  JAIR 2008»
13 years 8 months ago
ICE: An Expressive Iterative Combinatorial Exchange
We present the design and analysis of the first fully expressive, iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language (TBBL) that is co...
Benjamin Lubin, Adam I. Juda, Ruggiero Cavallo, S&...
EMNLP
2009
13 years 6 months ago
Sinuhe - Statistical Machine Translation using a Globally Trained Conditional Exponential Family Translation Model
We present a new phrase-based conditional exponential family translation model for statistical machine translation. The model operates on a feature representation in which sentenc...
Matti Kääriäinen