5153 search results - page 879 / 1031 » Introduction to Randomized Algorithms |
129
click to vote
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
113
click to vote
IWQOS
2005
Springer
15 years 8 months ago
2005
Springer
Network coding has been recently proposed in information theory as a new dimension of the information multicast problem that helps achieve optimal transmission rate or cost. End ho...
PAKDD
2005
ACM
15 years 8 months ago
2005
ACM
We explore in this paper a progressive sampling algorithm, called Sampling Error Estimation (SEE), which aims to identify an appropriate sample size for mining association rules. S...
123
Voted
PDCAT
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we propose a novel active queue management (AQM) scheme based on the Random Early Detection (RED) of the loss ratio and the total sending rate control, called LRC-R...
118
click to vote
SAT
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...