425 search results - page 10 / 85 » On the additive constant of the k-server Work Function Algor... |
114
Voted
BMCBI
2005
15 years 3 months ago
2005
Background: Interpreting the results of high-throughput experiments, such as those obtained from DNA-microarrays, is an often time-consuming task due to the high number of data-po...
131
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
103
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper, a scheduling problem is considered in the cellular network where there exist CBR (constant bit rate) users requiring exact minimum average throughput and delay g...
128
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Boosting is a popular way to derive powerful learners from simpler hypothesis classes. Following previous work (Mason et al., 1999; Friedman, 2000) on general boosting frameworks,...
125
Voted
NIPS
2007
15 years 4 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...