Sciweavers

2192 search results - page 19 / 439
» Algorithms for Challenging Motif Problems
Sort
View
JGAA
2007
135views more  JGAA 2007»
13 years 7 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
RECOMB
2004
Springer
14 years 8 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
BMCBI
2005
201views more  BMCBI 2005»
13 years 7 months ago
Principal component analysis for predicting transcription-factor binding motifs from array-derived data
Background: The responses to interleukin 1 (IL-1) in human chondrocytes constitute a complex regulatory mechanism, where multiple transcription factors interact combinatorially to...
Yunlong Liu, Matthew P. Vincenti, Hiroki Yokota
GECCO
2010
Springer
212views Optimization» more  GECCO 2010»
14 years 23 days ago
Generative and developmental systems
This paper argues that multiagent learning is a potential “killer application” for generative and developmental systems (GDS) because key challenges in learning to coordinate ...
Kenneth O. Stanley
MM
2006
ACM
175views Multimedia» more  MM 2006»
14 years 1 months ago
The challenge problem for automated detection of 101 semantic concepts in multimedia
We introduce the challenge problem for generic video indexing to gain insight in intermediate steps that affect performance of multimedia analysis methods, while at the same time...
Cees Snoek, Marcel Worring, Jan van Gemert, Jan-Ma...