Sciweavers

413 search results - page 75 / 83
» Are Hopfield Networks Faster than Conventional Computers
Sort
View
ISMB
2003
15 years 7 months ago
Deriving phylogenetic trees from the similarity analysis of metabolic pathways
Comparative analysis of metabolic pathways in different genomes can give insights into the understanding of evolutionary and organizational relationships among species. This type ...
Maureen Heymans, Ambuj K. Singh
ANCS
2006
ACM
15 years 12 months ago
Advanced algorithms for fast and scalable deep packet inspection
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
Sailesh Kumar, Jonathan S. Turner, John Williams
BMCBI
2005
130views more  BMCBI 2005»
15 years 5 months ago
Squid - a simple bioinformatics grid
Background: BLAST is a widely used genetic research tool for analysis of similarity between nucleotide and protein sequences. This paper presents a software application entitled &...
Paulo C. Carvalho, Rafael V. Glória, Antoni...
STACS
2010
Springer
16 years 26 days ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
NCA
2008
IEEE
16 years 8 days ago
FOSeL: Filtering by Helping an Overlay Security Layer to Mitigate DoS Attacks
Denial of service (DoS) attacks are major threat against availability in the Internet. A large number of countermeasure techniques try to detect attack and then filter out DoS at...
Hakem Beitollahi, Geert Deconinck