Sciweavers

789 search results - page 137 / 158
» Genetic algorithm can optimize hierarchical menus
Sort
View
SSPR
2004
Springer
14 years 1 months ago
Clustering Variable Length Sequences by Eigenvector Decomposition Using HMM
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
Fatih Murat Porikli
EMNLP
2008
13 years 9 months ago
Online Large-Margin Training of Syntactic and Structural Translation Features
Minimum-error-rate training (MERT) is a bottleneck for current development in statistical machine translation because it is limited in the number of weights it can reliably optimi...
David Chiang, Yuval Marton, Philip Resnik
MOBIHOC
2007
ACM
14 years 7 months ago
Scalable routing in delay tolerant networks
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
Cong Liu, Jie Wu
ICCV
2007
IEEE
14 years 10 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
13 years 11 months ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
Martin V. Butz, Martin Pelikan