683 search results - page 113 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
RCIS
2010
13 years 6 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—Many sensor network protocols in the literature implicitly assume that sensor nodes are deployed uniformly inside a simple geometric region. When the real deployment deviates fr...
ISAAC
2005
Springer
14 years 1 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...
SARA
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
HIPC
2007
Springer
13 years 11 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...