Sciweavers

1860 search results - page 190 / 372
» Automatic Generation of Search Engines
Sort
View
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 4 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
TREC
2003
13 years 11 months ago
Searching for geneRIFs: Concept-Based Query Expansion and Bayes Classification
k gene annotations. Our indexing machinery produces per indexed MEDLINE abstract a list of concepts with an accompanying weight, termed a fingerprint. Searching is done by matching...
Rob Jelier, Martijn J. Schuemie, C. Christiaan van...
PRDC
2007
IEEE
14 years 3 months ago
Generic Fault-Tolerance Mechanisms Using the Concept of Logical Execution Time
Model-based development has become state of the art in software engineering. Unfortunately, the used code generators often focus on the pure application functionality. Features li...
Christian Buckl, Matthias Regensburger, Alois Knol...
ASE
2006
161views more  ASE 2006»
13 years 9 months ago
Automated Prototyping of User Interfaces Based on UML Scenarios
User interface (UI) prototyping and scenario engineering have become popular techniques. Yet, the transition from scenario to formal specifications and the generation of UI code is...
Mohammed Elkoutbi, Ismaïl Khriss, Rudolf K. K...
APSEC
2009
IEEE
13 years 7 months ago
A Formal Framework to Integrate Timed Security Rules within a TEFSM-Based System Specification
Abstract--Formal methods are very useful in software industry and are becoming of paramount importance in practical engineering techniques. They involve the design and the modeling...
Wissam Mallouli, Amel Mammar, Ana R. Cavalli