Sciweavers

719 search results - page 57 / 144
» Adaptive Online Time Allocation to Search Algorithms
Sort
View
IPPS
1997
IEEE
15 years 2 months ago
d-Dimensional Range Search on Multicomputers
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin...
BIBM
2009
IEEE
118views Bioinformatics» more  BIBM 2009»
15 years 1 months ago
Inexact Local Alignment Search over Suffix Arrays
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may conta...
Mohammadreza Ghodsi, Mihai Pop
ICISC
2004
169views Cryptology» more  ICISC 2004»
14 years 11 months ago
ADWICE - Anomaly Detection with Real-Time Incremental Clustering
Abstract. Anomaly detection, detection of deviations from what is considered normal, is an important complement to misuse detection based on attack signatures. Anomaly detection in...
Kalle Burbeck, Simin Nadjm-Tehrani
IPPS
2007
IEEE
15 years 4 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
IPPS
2002
IEEE
15 years 2 months ago
An Associative Static and Dynamic Convex Hull Algorithm
This paper presents a new static and dynamic recursive parallel algorithm for the convex hull problem. This algorithm is a parallel adaptation of the Graham Scan and Quick Hull al...
Maher M. Atwah, Johnnie W. Baker