144 search results - page 17 / 29 » Non-blocking binary search trees |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—Dictionary-Based String Matching (DBSM) is used in network Deep Packet Inspection (DPI) applications virus scanning [1] and network intrusion detection [2]. We propose the Pipel...
112
click to vote
DATAMINE
1999
14 years 9 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— For many wireless communication links, such as those employing turbo codes or sequentially-decoded convolutional codes, the power consumption of the decoder at the receiver dep...
SODA
2012
ACM
13 years 4 days ago
2012
ACM
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...