Amanote Research

Amanote Research

    RegisterSign In

Event Matching Using the Transitive Closure of Dependency Relations

doi 10.3115/1557690.1557729
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2008

Authors
Daniel M. BikelVittorio Castelli
Publisher

Association for Computational Linguistics


Related search

Transitive Closure Based Visual Words for Point Matching in Video Sequence

2010English

Transitive-Closure Spanners

2009English

A Transitive Closure Algorithm

BIT Numerical Mathematics
Computer NetworksApplied MathematicsSoftwareComputational MathematicsCommunications
1970English

Arbitrarily Shaped Rectilinear Module Placement Using the Transitive Closure Graph Representation

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
HardwareElectronic EngineeringElectricalArchitectureSoftware
2002English

Question Answering Passage Retrieval Using Dependency Relations

2005English

Graph Encoding and Transitive Closure Representation

English

Algorithm 36. Transitive Closure of a Graph

Applicationes Mathematicae
1974English

Optimizing Numerical Code by Means of the Transitive Closure of Dependence Graphs

2017English

On Aggregation Operators of Transitive Similarity and Dissimilarity Relations

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy