Sciweavers

1561 search results - page 129 / 313
» Segments Matching Using a Neural Network Approach
Sort
View
149
Voted
AMC
2005
117views more  AMC 2005»
15 years 5 months ago
Teleonomic entropy: measuring the phase-space of end-directed systems
We introduce a novel way of measuring the entropy of a set of values undergoing changes. Such a measure becomes useful when analyzing the temporal development of an algorithm desi...
Alexander Pudmenzky
115
Voted
IWANN
2005
Springer
15 years 10 months ago
A Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...
Carlos Cotta
IPPS
2003
IEEE
15 years 10 months ago
A Genetic Approach to Planning in Heterogeneous Computing Environments
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...
ICPR
2004
IEEE
16 years 6 months ago
Robust Feature Matching Across Widely Separated Color Images
We present a novel method for feature matching across widely separated color images. The proposed approach is robust and can support various correspondence based algorithms e.g. t...
Alexander Kaplan, Ehud Rivlin, Ilan Shimshoni
ICASSP
2009
IEEE
15 years 11 months ago
Conditional random fields for the prediction of signal peptide cleavage sites
Correct prediction of signal peptide cleavage sites has a significant impact on drug design. State-of-the-art approaches to cleavage site prediction typically use generative mode...
Man-Wai Mak, Sun-Yuan Kung