Sciweavers

382 search results - page 55 / 77
» A Formalization of Trust Alignment
Sort
View
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 2 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
IPPS
1998
IEEE
13 years 12 months ago
Randomization in Parallel Stringology
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...
S. Muthukrishnan
COMPSAC
2009
IEEE
14 years 2 months ago
Towards Validating Security Protocol Deployment in the Wild
As computing technology becomes increasingly pervasive and interconnected, mobility leads to shorter-lasting relationships between end-points with many different security requirem...
Luca Compagna, Ulrich Flegel, Volkmar Lotz
DIS
2009
Springer
14 years 2 months ago
Towards an Ontology of Data Mining Investigations
Motivated by the need for unification of the domain of data mining and the demand for formalized representation of outcomes of data mining investigations, we address the task of c...
Pance Panov, Larisa N. Soldatova, Saso Dzeroski
COSIT
2003
Springer
129views GIS» more  COSIT 2003»
14 years 27 days ago
Linearized Terrain: Languages for Silhouette Representations
The scope of this paper is a qualitative description of terrain features that can be characterized using the silhouette of a terrain. The silhouette is a profile of a landform seen...
Lars Kulik, Max J. Egenhofer