Sciweavers

2597 search results - page 507 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
TCOM
2008
92views more  TCOM 2008»
13 years 8 months ago
Mailbox switch: a scalable two-stage switch architecture for conflict resolution of ordered packets
Abstract-- Traditionally, conflict resolution in an inputbuffered switch is solved by finding a matching between inputs and outputs per time slot. To do this, a switch not only nee...
Cheng-Shang Chang, Duan-Shin Lee, Ying-Ju Shih, Ch...
TCS
2008
13 years 8 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
IPL
2007
72views more  IPL 2007»
13 years 8 months ago
How to safely close a discussion
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
Gildas Avoine, Serge Vaudenay
BMCBI
2005
134views more  BMCBI 2005»
13 years 8 months ago
Windows .NET Network Distributed Basic Local Alignment Search Toolkit (W.ND-BLAST)
Background: BLAST is one of the most common and useful tools for Genetic Research. This paper describes a software application we have termed Windows .NET Distributed Basic Local ...
Scot E. Dowd, Joaquin Zaragoza, Javier R. Rodrigue...
BMCBI
2005
90views more  BMCBI 2005»
13 years 8 months ago
TMB-Hunt: An amino acid composition based method to screen proteomes for beta-barrel transmembrane proteins
Background: Beta-barrel transmembrane (bbtm) proteins are a functionally important and diverse group of proteins expressed in the outer membranes of bacteria (both gram negative a...
Andrew G. Garrow, Alison Agnew, David R. Westhead