Amanote Research

Amanote Research

    RegisterSign In

SETS: Scalable and Efficient Tree Search in Dependency Graphs

doi 10.3115/v1/n15-3011
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2015

Authors
Juhani LuotolahtiJenna KanervaSampo PyysaloFilip Ginter
Publisher

Association for Computational Linguistics


Related search

Efficient Tree Search in Encrypted Data

2004English

GreenBST: Energy-Efficient Concurrent Search Tree

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Scalable Indexing of RDF Graphs for Efficient Join Processing

2009English

Efficient Steiner Tree Construction Based on Spanning Graphs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ElectricalSoftwareComputer GraphicsComputer-Aided DesignElectronic Engineering
2004English

Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

MINERVA∞: A Scalable Efficient Peer-To-Peer Search Engine

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Transparency and Building Lexical Dependency Graphs

Annual Meeting of the Berkeley Linguistics Society
2002English

Survivable Routing in IP-over-WDM Networks: An Efficient and Scalable Local Search Algorithm

Optical Switching and Networking
Computer NetworksElectronic EngineeringElectricalCommunications
2005English

Dependency Tree Annotation Software

2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy