Sciweavers

4816 search results - page 649 / 964
» Performance analysis of the AntNet algorithm
Sort
View
CIKM
2009
Springer
15 years 10 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
GECCO
2006
Springer
165views Optimization» more  GECCO 2006»
15 years 10 months ago
Comparing mathematical models on the problem of network inference
In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different mathemat...
Christian Spieth, Nadine Hassis, Felix Streichert
VCIP
2003
238views Communications» more  VCIP 2003»
15 years 8 months ago
Texture segmentation based on features in wavelet domain for image retrieval
Texture is a fundamental feature which provides significant information for image classification, and is an important content used in content-based image retrieval (CBIR) system. ...
Ying Liu, Si Wu, Xiaofang Zhou
PRL
2006
180views more  PRL 2006»
15 years 6 months ago
MutualBoost learning for selecting Gabor features for face recognition
This paper describes an improved boosting algorithm, the MutualBoost algorithm, and its application in developing a fast and robust Gabor feature based face recognition system. Th...
LinLin Shen, Li Bai
TCS
2008
15 years 6 months ago
Main-memory triangle computations for very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
Matthieu Latapy