Sciweavers

352 search results - page 52 / 71
» Problem section
Sort
View
RECOMB
2005
Springer
14 years 10 months ago
Learning Interpretable SVMs for Biological Sequence Classification
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
Christin Schäfer, Gunnar Rätsch, Sö...
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 3 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
PKDD
2005
Springer
188views Data Mining» more  PKDD 2005»
14 years 3 months ago
Elastic Partial Matching of Time Series
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
Longin Jan Latecki, Vasilis Megalooikonomou, Qiang...
BMCBI
2010
175views more  BMCBI 2010»
13 years 9 months ago
Towards high performance computing for molecular structure prediction using IBM Cell Broadband Engine - an implementation perspe
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...
S. P. T. Krishnan, Sim Sze Liang, Bharadwaj Veerav...
AIL
2004
107views more  AIL 2004»
13 years 9 months ago
AI and the Conquest of Complexity in Law
The paper identi es some of the problems with legal systems and outlines the potential of AI technology for overcoming them. For expository purposes, this outline is based on a si...
L. Bibel