Sciweavers

1184 search results - page 176 / 237
» Algorithmic Results in List Decoding
Sort
View
147
Voted
TRECVID
2007
15 years 4 months ago
SINAI at TRECVID 2007
This paper describes the first participation of the SINAI1 group of the University of Ja´en in TRECVID 2007. We have only participated in the automatic search task. Our approach...
Manuel Carlos Díaz-Galiano, José M. ...
143
Voted
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 4 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
136
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 3 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
139
Voted
GECCO
2008
Springer
175views Optimization» more  GECCO 2008»
15 years 4 months ago
Using differential evolution for symbolic regression and numerical constant creation
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
Brian M. Cerny, Peter C. Nelson, Chi Zhou
132
Voted
BMCBI
2006
144views more  BMCBI 2006»
15 years 3 months ago
More robust detection of motifs in coexpressed genes by using phylogenetic information
Background: Several motif detection algorithms have been developed to discover overrepresented motifs in sets of coexpressed genes. However, in a noisy gene list, the number of ge...
Pieter Monsieurs, Gert Thijs, Abeer A. Fadda, Sigr...