Sciweavers

2526 search results - page 433 / 506
» A Comparative Evaluation of Name-Matching Algorithms
Sort
View
156
Voted
GECCO
2008
Springer
201views Optimization» more  GECCO 2008»
15 years 4 months ago
Advanced techniques for the creation and propagation of modules in cartesian genetic programming
The choice of an appropriate hardware representation model is key to successful evolution of digital circuits. One of the most popular models is cartesian genetic programming, whi...
Paul Kaufmann, Marco Platzner
114
Voted
GIR
2008
ACM
15 years 4 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
158
Voted
ICML
2010
IEEE
15 years 4 months ago
Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...
Niranjan Srinivas, Andreas Krause, Sham Kakade, Ma...
163
Voted
ICML
2010
IEEE
15 years 4 months ago
Submodular Dictionary Selection for Sparse Representation
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
Andreas Krause, Volkan Cevher
206
Voted
MM
2010
ACM
462views Multimedia» more  MM 2010»
15 years 3 months ago
KPB-SIFT: a compact local feature descriptor
Invariant feature descriptors such as SIFT and GLOH have been demonstrated to be very robust for image matching and object recognition. However, such descriptors are typically of ...
Gangqiang Zhao, Ling Chen, Gencai Chen, Junsong Yu...