Sciweavers

2498 search results - page 467 / 500
» Data Structures with Unpredictable Timing
Sort
View
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
14 years 11 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
CCS
2006
ACM
14 years 11 months ago
Dynamic rule-ordering optimization for high-speed firewall filtering
Packet filtering plays a critical role in many of the current high speed network technologies such as firewalls and IPSec devices. The optimization of firewall policies is critica...
Hazem Hamed, Ehab Al-Shaer
AAAI
2010
14 years 11 months ago
Multi-Agent Plan Recognition: Formalization and Algorithms
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle
JISBD
2000
14 years 11 months ago
Databases and Natural Language Interfaces
A Natural Language Interface for Databases allows users of multimedia kiosks to formulate natural language questions. User questions are first translated into a logic language and ...
Porfírio P. Filipe, Nuno J. Mamede
BMCBI
2010
189views more  BMCBI 2010»
14 years 9 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...