Sciweavers

224 search results - page 29 / 45
» The Complexity of Finding Replicas Using Equality Tests
Sort
View
COMGEO
2006
ACM
14 years 9 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
BMCBI
2007
123views more  BMCBI 2007»
14 years 9 months ago
BIRCH: A user-oriented, locally-customizable, bioinformatics system
Background: Molecular biologists need sophisticated analytical tools which often demand extensive computational resources. While finding, installing, and using these tools can be ...
Brian Fristensky
ICDM
2009
IEEE
145views Data Mining» more  ICDM 2009»
14 years 7 months ago
Significance of Episodes Based on Minimal Windows
Discovering episodes, frequent sets of events from a sequence has been an active field in pattern mining. Traditionally, a level-wise approach is used to discover all frequent epis...
Nikolaj Tatti
COMPSEC
2004
131views more  COMPSEC 2004»
14 years 9 months ago
Biometric random number generators
Abstract Up to now biometric methods have been used in cryptography for authentication purposes. In this paper we propose to use biological data for generating sequences of random ...
Janusz Szczepanski, Elek Wajnryb, José M. A...
97
Voted
BMCBI
2006
114views more  BMCBI 2006»
14 years 9 months ago
A direct comparison of protein interaction confidence assignment schemes
Background: Recent technological advances have enabled high-throughput measurements of protein-protein interactions in the cell, producing large protein interaction networks for v...
Silpa Suthram, Tomer Shlomi, Eytan Ruppin, Roded S...