3055 search results - page 231 / 611 » Randomized Search Trees |
110
Voted
COMBINATORICS
2002
15 years 29 days ago
2002
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
79
Voted
IJISEC
2002
15 years 24 days ago
2002
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is informationtheoretically secure from t...
92
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
In online handwritten math expression recognition, one-pass dynamic programming can produce highquality symbol graphs in addition to best symbol sequence hypotheses [3], especiall...
84
Voted
AINA
2005
IEEE
15 years 6 months ago
2005
IEEE
Ternary content addressable (TCAM) is favorable for high-speed search due to its parallel architecture and ability for searching arbitrary-length keys. However, the usage of TCAM ...
92
Voted
CG
2004
Springer
15 years 6 months ago
2004
Springer
In this paper a new method is described for move ordering, called the relative history heuristic. It is a combination of the history heuristic and the butterfly heuristic. Instead...