Sciweavers

10988 search results - page 297 / 2198
» Algorithmic Folding Complexity
Sort
View
MST
2011
231views Hardware» more  MST 2011»
14 years 7 months ago
On the Complexity of Matroid Isomorphism Problem
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
B. V. Raghavendra Rao, Jayalal M. N. Sarma
CVPR
2012
IEEE
13 years 6 months ago
Learning latent temporal structure for complex event detection
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...
Kevin Tang, Fei-Fei Li, Daphne Koller
GECCO
2005
Springer
288views Optimization» more  GECCO 2005»
15 years 10 months ago
A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices
Genetic Algorithms (GAs) are a search and optimization technique based on the mechanism of evolution. Recently, another sort of population-based optimization method called Estimat...
Naoki Mori, Masayuki Takeda, Keinosuke Matsumoto
CPM
2008
Springer
154views Combinatorics» more  CPM 2008»
15 years 6 months ago
Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...
Mathias Möhl, Sebastian Will, Rolf Backofen
EVOW
2003
Springer
15 years 9 months ago
Landscape State Machines: Tools for Evolutionary Algorithm Performance Analyses and Landscape/Algorithm Mapping
Abstract. Many evolutionary algorithm applications involve either fitness functions with high time complexity or large dimensionality (hence very many fitness evaluations will typi...
David Corne, Martin J. Oates, Douglas B. Kell