Sciweavers

432 search results - page 41 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 6 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
BMCBI
2008
103views more  BMCBI 2008»
15 years 2 months ago
TOPS++FATCAT: Fast flexible structural alignment using constraints derived from TOPS+ Strings Model
Background: Protein structure analysis and comparison are major challenges in structural bioinformatics. Despite the existence of many tools and algorithms, very few of them have ...
Mallika Veeramalai, Yuzhen Ye, Adam Godzik
MFCS
2009
Springer
15 years 8 months ago
Query Automata for Nested Words
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deï...
P. Madhusudan, Mahesh Viswanathan
FOCS
1993
IEEE
15 years 6 months ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani
ANCS
2007
ACM
15 years 6 months ago
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
Sailesh Kumar, Balakrishnan Chandrasekaran, Jonath...