Sciweavers

360 search results - page 29 / 72
» Learning Evaluation Functions for Large Acyclic Domains
Sort
View
COLT
2008
Springer
13 years 10 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
CVPR
2006
IEEE
14 years 10 months ago
BoostMotion: Boosting a Discriminative Similarity Function for Motion Estimation
Motion estimation for applications where appearance undergoes complex changes is challenging due to lack of an appropriate similarity function. In this paper, we propose to learn ...
Shaohua Kevin Zhou, Bogdan Georgescu, Dorin Comani...
EVOW
2007
Springer
14 years 15 days ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 9 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 15 days ago
Evolving distributed agents for managing air traffic
Air traffic management offers an intriguing real world challenge to designing large scale distributed systems using evolutionary computation. The ability to evolve effective air t...
Adrian K. Agogino, Kagan Tumer