500 search results - page 62 / 100 » Approximation algorithms for maximum independent set of pseu... |
108
Voted
ISCC
2000
IEEE
15 years 6 months ago
2000
IEEE
We consider the adaptation of random early detection (RED) as a buffer management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTUs) are ...
110
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...
127
Voted
CVPR
2000
IEEE
16 years 3 months ago
2000
IEEE
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
107
Voted
DCC
2002
IEEE
16 years 1 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
120
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...