109 search results - page 10 / 22 » Algorithm Selection as a Bandit Problem with Unbounded Losse... |
ICCV
2001
IEEE
14 years 9 months ago
2001
IEEE
The number of features that can be computed over an image is, for practical purposes, limitless. Unfortunately, the number of features that can be computed and exploited by most c...
PODC
2010
ACM
13 years 9 months ago
2010
ACM
In this paper, we address the problem of content placement in peer-to-peer systems, with the objective of maximizing the utilization of peers' uplink bandwidth resources. We ...
CSB
2003
IEEE
14 years 20 days ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
TWC
2011
13 years 2 months ago
2011
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...