Sciweavers

3055 search results - page 146 / 611
» Randomized Search Trees
Sort
View
RR
2009
Springer
14 years 3 months ago
Search for More Declarativity
Abstract. Good tree search algorithms are a key requirement for inference engines of rule languages. As Prolog exemplifies, inference engines based on traditional uninformed searc...
Simon Brodt, François Bry, Norbert Eisinger
DASFAA
2008
IEEE
139views Database» more  DASFAA 2008»
14 years 16 days ago
Exploiting ID References for Effective Keyword Search in XML Documents
In this paper, we study novel Tree + IDREF data model for keyword search in XML. In this model, we propose novel Lowest Referred Ancestor (LRA) pair, Extended LRA (ELRA) pair and E...
Bo Chen, Jiaheng Lu, Tok Wang Ling
NAACL
2010
13 years 8 months ago
Tree Edit Models for Recognizing Textual Entailments, Paraphrases, and Answers to Questions
We describe tree edit models for representing sequences of tree transformations involving complex reordering phenomena and demonstrate that they offer a simple, intuitive, and eff...
Michael Heilman, Noah A. Smith
VLDB
1991
ACM
134views Database» more  VLDB 1991»
14 years 2 months ago
Extending the Search Strategy in a Query Optimizer
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
Rosana S. G. Lanzelotte, Patrick Valduriez
AINA
2007
IEEE
14 years 5 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein