109 search results - page 19 / 22 » Algorithm Selection as a Bandit Problem with Unbounded Losse... |
ICIP
2007
IEEE
14 years 7 months ago
2007
IEEE
In this paper we propose a domain partitioning RankBoost approach for face recognition. This method uses Local Gabor Binary Pattern Histogram (LGBPH) features for face representat...
WCNC
2008
IEEE
14 years 4 days ago
2008
IEEE
— Recent work has developed single-carrier linear precoding for the multiuser downlink for multiple-input multipleoutput (MIMO) systems. This paper addresses the problem of user ...
WSDM
2010
ACM
13 years 10 months ago
2010
ACM
Ranking a set of retrieved documents according to their relevance to a given query has become a popular problem at the intersection of web search, machine learning, and informatio...
CIKM
2009
Springer
14 years 11 days ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...