Sciweavers

359 search results - page 66 / 72
» On the number of chord diagrams
Sort
View
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
14 years 1 months ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert
IPPS
1999
IEEE
14 years 27 days ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
AIPS
2003
13 years 10 months ago
Decision-Theoretic Group Elevator Scheduling
We present an efficient algorithm for exact calculation and minimization of expected waiting times of all passengers using a bank of elevators. The dynamics of the system are rep...
Daniel Nikovski, Matthew Brand
DAM
2008
114views more  DAM 2008»
13 years 8 months ago
Efficient solutions to the braid isotopy problem
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
Patrick Dehornoy
JSS
2000
86views more  JSS 2000»
13 years 8 months ago
Quantitative analysis of static models of processes
The upstream activities of software development projects are often viewed as both the most important, the least understood, and hence the most problematic. This is particularly no...
Keith Phalp, Martin J. Shepperd