Sciweavers

1376 search results - page 6 / 276
» Searching Trees: An Essay
Sort
View
SWAT
2010
Springer
270views Algorithms» more  SWAT 2010»
15 years 2 months ago
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
We present the zipper tree, the first O(log log n)-competitive online binary search tree that performs each access in O(log n) worst-case time. This shows that for binary search ...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
58
Voted
CISIS
2009
IEEE
15 years 4 months ago
Multiple-Paths Search with Concurrent Thread Scheduling for Fast AND/OR Tree Search
This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only ...
Fumiyo Takano, Yoshitaka Maekawa, Hironori Kasahar...
66
Voted
NAACL
2010
14 years 7 months ago
A Treebank Query System Based on an Extracted Tree Grammar
Recent work has proposed the use of an extracted tree grammar as the basis for treebank analysis and search queries, in which queries are stated over the elementary trees, which a...
Seth Kulick, Ann Bies
94
Voted
FOCS
2006
IEEE
15 years 3 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys