530 search results - page 22 / 106 » Learning Bounds for Domain Adaptation |
145
Voted
ECTEL
2010
Springer
15 years 25 days ago
2010
Springer
In this article we present an infrastructure for creating mash up and visual representations of the user profile that combine data from different sources. We explored this approach...
104
Voted
VMV
2008
15 years 4 months ago
2008
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
117
Voted
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
145
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
In this paper, we investigate multi-agent learning (MAL) in a multi-agent resource selection problem (MARS) in which a large group of agents are competing for common resources. Si...
109
Voted
COLT
2008
Springer
15 years 5 months ago
2008
Springer
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...