1034 search results - page 182 / 207 » Small Pi01 Classes |
137
Voted
ALGORITHMICA
2010
15 years 4 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
123
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: To meet the needs of gene annotation for newly sequenced organisms, optimized spaced seeds can be implemented into cross-species sequence alignment programs to accurat...
159
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has m...
101
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study a problem where wireless service providers compete for heterogenous and atomic (non-infinitesimal) wireless users. The users differ in their utility functions as well as ...
150
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...