Sciweavers

2363 search results - page 373 / 473
» Learning Algorithms for Domain Adaptation
Sort
View
DATE
2010
IEEE
180views Hardware» more  DATE 2010»
14 years 3 months ago
A reconfigurable cache memory with heterogeneous banks
Abstract— The optimal size of a large on-chip cache can be different for different programs: at some point, the reduction of cache misses achieved when increasing cache size hits...
Domingo Benitez, Juan C. Moure, Dolores Rexachs, E...
ICIP
2009
IEEE
13 years 8 months ago
Synthesis-in-the-loop for video texture coding
In this paper, we present an algorithm using dynamic texture synthesis for closed-loop video coding. Video textures, or so-called dynamic textures are video sequences with moving ...
Aleksandar Stojanovic, Mathias Wien, Thiow Keng Ta...
ICML
2008
IEEE
14 years 11 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
ICML
2005
IEEE
14 years 11 months ago
Unifying the error-correcting and output-code AdaBoost within the margin framework
In this paper, we present a new interpretation of AdaBoost.ECC and AdaBoost.OC. We show that AdaBoost.ECC performs stage-wise functional gradient descent on a cost function, defin...
Yijun Sun, Sinisa Todorovic, Jian Li, Dapeng Wu
ICML
2003
IEEE
14 years 11 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich