Sciweavers

874 search results - page 122 / 175
» Iterative Learning Control - Monotonicity and Optimization
Sort
View
LION
2010
Springer
190views Optimization» more  LION 2010»
15 years 1 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber
TOG
2010
64views more  TOG 2010»
14 years 4 months ago
K-set tilable surfaces
This paper introduces a method for optimizing the tiles of a quadmesh. Given a quad-based surface, the goal is to generate a set of K quads whose instances can produce a tiled sur...
Chi-Wing Fu, Chi-Fu Lai, Ying He 0001, Daniel Cohe...
PR
2006
164views more  PR 2006»
14 years 9 months ago
Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
Hong Chang, Dit-Yan Yeung
ICDE
2004
IEEE
85views Database» more  ICDE 2004»
15 years 11 months ago
A Frequency-based Approach for Mining Coverage Statistics in Data Integration
Query optimization in data integration requires source coverage and overlap statistics. Gathering and storing the required statistics presents many challenges, not the least of wh...
Zaiqing Nie, Subbarao Kambhampati
ICTAI
1993
IEEE
15 years 2 months ago
Robust Feature Selection Algorithms
Selecting a set of features which is optimal for a given task is a problem which plays an important role in a wide variety of contexts including pattern recognition, adaptive cont...
Haleh Vafaie, Kenneth DeJong