Sciweavers

729 search results - page 39 / 146
» Computing persistent homology
Sort
View
USS
2008
15 years 6 hour ago
Security Benchmarking using Partial Verification
Implementation-level vulnerabilities are a persistent threat to the security of computing systems. We propose using the results of partially-successful verification attempts to pl...
Thomas E. Hart, Marsha Chechik, David Lie
CSB
2004
IEEE
142views Bioinformatics» more  CSB 2004»
15 years 1 months ago
FastR: Fast Database Search Tool for Non-Coding RNA
The discovery of novel non-coding RNAs has been among the most exciting recent developments in Biology. Yet, many more remain undiscovered. It has been hypothesized that there is ...
Vineet Bafna, Shaojie Zhang
RECOMB
2005
Springer
15 years 10 months ago
Individual Gene Cluster Statistics in Noisy Maps
Abstract. Identification of homologous chromosomal regions is important for understanding evolutionary processes that shape genome evolution, such as genome rearrangements and larg...
Narayanan Raghupathy, Dannie Durand
ICPR
2008
IEEE
15 years 4 months ago
Linear time recognition algorithms for topological invariants in 3D
In this paper, we design linear time algorithms to recognize and determine topological invariants such as genus and homology groups in 3D. These invariants can be used to identify...
Li Chen, Yongwu Rong
SIAMNUM
2010
123views more  SIAMNUM 2010»
14 years 4 months ago
Critical Analysis of the Spanning Tree Techniques
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be usef...
Pawel Dlotko, Ruben Specogna