Sciweavers

2111 search results - page 311 / 423
» Understanding the Yarowsky Algorithm
Sort
View
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
15 years 7 months ago
Using quotient graphs to model neutrality in evolutionary search
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
Dominic Wilson, Devinder Kaur
GIR
2008
ACM
15 years 7 months ago
Map-based vs. knowledge-based toponym disambiguation
Toponym Disambiguation, i.e. the task of assigning to place name their correct reference in the world, is getting more attention from many researchers. Many methods have been prop...
Davide Buscaldi, Paolo Rosso
ICML
2010
IEEE
15 years 7 months ago
Gaussian Processes Multiple Instance Learning
This paper proposes a multiple instance learning (MIL) algorithm for Gaussian processes (GP). The GP-MIL model inherits two crucial benefits from GP: (i) a principle manner of lea...
Minyoung Kim, Fernando De la Torre
BIBE
2010
IEEE
135views Bioinformatics» more  BIBE 2010»
15 years 6 months ago
Finding Dynamic Modules of Biological Regulatory Networks
—Often groups of genes in regulatory networks, also called modules, work collaboratively on similar functions. Mathematically, the modules in a regulatory network has often been ...
Ferhat Ay, Thang N. Dinh, My T. Thai, Tamer Kahvec...
MM
2010
ACM
137views Multimedia» more  MM 2010»
15 years 6 months ago
Unsupervised summarization of rushes videos
This paper proposes a new framework to formulate the problem of rushes video summarization as an unsupervised learning problem. We pose the problem of video summarization as one o...
Yang Liu, Feng Zhou, Wei Liu, Fernando De la Torre...