514 search results - page 92 / 103 » Packet Classification Algorithms: From Theory to Practice |
SIAMCOMP
2002
13 years 7 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
UPP
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. This is just a glimpse to the fruitful and constant preoccupation of computer science to try to get inspired by biology, at various levels. Besides briefly discussing th...
LATIN
2010
Springer
14 years 20 days ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
CIDM
2009
IEEE
14 years 2 months ago
2009
IEEE
— Both theory and a wealth of empirical studies have established that ensembles are more accurate than single predictive models. Unfortunately, the problem of how to maximize ens...
CIVR
2007
Springer
14 years 1 months ago
2007
Springer
In the present study, an efficient strategy for retrieving texture images from large texture databases is introduced and studied within a distributional-statistical framework. Our...