144 search results - page 16 / 29 » A speculation-friendly binary search tree |
112
click to vote
CP
2006
Springer
15 years 3 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
ESA
2000
Springer
15 years 3 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
107
click to vote
CORR
2010
Springer
14 years 12 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...
81
Voted
INFOCOM
2010
IEEE
14 years 10 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...
127
click to vote
DATAMINE
1999
14 years 11 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...