Sciweavers

101 search results - page 15 / 21
» Optimal Random Matchings on Trees and Applications
Sort
View
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 9 days ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
CVPR
2011
IEEE
13 years 3 months ago
Coupled Information-Theoretic Encoding for Face Photo-Sketch Recognition
Automatic face photo-sketch recognition has important applications to law enforcement. Recent research has focused on transforming photos and sketches into the same modality for m...
Wei Zhang, Xiaogang Wang, Xiaoou Tang
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
14 years 1 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
PRIB
2010
Springer
242views Bioinformatics» more  PRIB 2010»
13 years 5 months ago
Consensus of Ambiguity: Theory and Application of Active Learning for Biomedical Image Analysis
Abstract. Supervised classifiers require manually labeled training samples to classify unlabeled objects. Active Learning (AL) can be used to selectively label only “ambiguous...
Scott Doyle, Anant Madabhushi
PDP
2008
IEEE
14 years 1 months ago
Internet-Scale Simulations of a Peer Selection Algorithm
The match between a peer-to-peer overlay and the physical Internet infrastructure is a constant issue. Time-constrained peer-to-peer applications such as live streaming systems ar...
Ali Boudani, Yiping Chen, Gilles Straub, Gwendal S...