Sciweavers

99 search results - page 15 / 20
» Improved bounds and new techniques for Davenport-Schinzel se...
Sort
View
CVPR
2010
IEEE
14 years 4 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler
EUROCRYPT
2007
Springer
14 years 2 months ago
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin
ICML
2010
IEEE
13 years 9 months ago
OTL: A Framework of Online Transfer Learning
In this paper, we investigate a new machine learning framework called Online Transfer Learning (OTL) that aims to transfer knowledge from some source domain to an online learning ...
Peilin Zhao, Steven C. H. Hoi
CEC
2010
IEEE
13 years 9 months ago
Generating a novel sort algorithm using Reinforcement Programming
Abstract-- Reinforcement Programming (RP) is a new approach to automatically generating algorithms, that uses reinforcement learning techniques. This paper describes the RP approac...
Spencer K. White, Tony R. Martinez, George L. Rudo...
HPDC
2010
IEEE
13 years 8 months ago
Toward high performance computing in unconventional computing environments
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
Brent Rood, Nathan Gnanasambandam, Michael J. Lewi...