Sciweavers

3136 search results - page 166 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
CPM
2009
Springer
207views Combinatorics» more  CPM 2009»
15 years 10 months ago
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
Simone Faro, Thierry Lecroq
ICPADS
2005
IEEE
15 years 12 months ago
Distributed Integrity Checking for Systems with Replicated Data
This work presents a new comparison-based diagnosis model and a new algorithm, called Hi-Dif, based on this model. The algorithm is used for checking the integrity of systems with...
Roverli Pereira Ziwich, Elias Procópio Duar...
EJWCN
2010
156views more  EJWCN 2010»
15 years 1 months ago
On Performance Modeling of Ad Hoc Routing Protocols
Simulation studies have been the predominant method of evaluating ad hoc routing algorithms. Despite their wide use and merits, simulations are generally time consuming. Furthermo...
Muhammad Saleem, Syed Ali Khayam, Muddassar Farooq
CVPR
2006
IEEE
16 years 8 months ago
Hierarchical Procrustes Matching for Shape Retrieval
We introduce Hierarchical Procrustes Matching (HPM), a segment-based shape matching algorithm which avoids problems associated with purely global or local methods and performs wel...
Graham McNeill, Sethu Vijayakumar
DAC
1998
ACM
16 years 7 months ago
Approximation and Decomposition of Binary Decision Diagrams
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
Kavita Ravi, Kenneth L. McMillan, Thomas R. Shiple...