Sciweavers

157 search results - page 10 / 32
» A Simple Algorithm for Finding Exact Common Repeats
Sort
View
FLAIRS
2004
13 years 8 months ago
Indirect Encoding Evolutionary Learning Algorithm for the Multilayer Morphological Perceptron
This article describes an indirectly encoded evolutionary learning algorithm to train morphological neural networks. The indirect encoding method is an algorithm in which the trai...
Jorge L. Ortiz, Roberto Piñeiro
BIBM
2009
IEEE
118views Bioinformatics» more  BIBM 2009»
13 years 11 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
ICALP
2000
Springer
13 years 11 months ago
An Optimal Minimum Spanning Tree Algorithm
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
Seth Pettie, Vijaya Ramachandran
PPOPP
2009
ACM
14 years 8 months ago
Idempotent work stealing
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...
Maged M. Michael, Martin T. Vechev, Vijay A. Saras...
CVPR
2007
IEEE
14 years 9 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor