Sciweavers

2225 search results - page 272 / 445
» Logical Structures in the Lexicon
Sort
View
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 10 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
JUCS
2006
94views more  JUCS 2006»
15 years 6 months ago
UML-Based Modeling of Data-oriented WEB Applications
Abstract: Recently a growing demand has arisen for methods for the development of smalland medium scale Web Information Systems (WIS). Web applications are being built in a rapidly...
Attila Adamkó
JUCS
2006
141views more  JUCS 2006»
15 years 6 months ago
Constraint Based Methods for Biological Sequence Analysis
: The need for processing biological information is rapidly growing, owing to the masses of new information in digital form being produced at this time. Old methodologies for proce...
Maryam Bavarian, Verónica Dahl
BSL
2004
110views more  BSL 2004»
15 years 6 months ago
Notes on quasiminimality and excellence
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...
John T. Baldwin
ICDE
2004
IEEE
105views Database» more  ICDE 2004»
16 years 7 months ago
SPINE: Putting Backbone into String Indexing
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
Naresh Neelapala, Romil Mittal, Jayant R. Haritsa