Sciweavers

4911 search results - page 82 / 983
» Tree dependence analysis
Sort
View
ICCNMC
2005
Springer
14 years 4 months ago
Least Cost Multicast Spanning Tree Algorithm for Local Computer Network
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
Yong-Jin Lee, Mohammed Atiquzzaman
ACL
2011
13 years 2 months ago
Event Extraction as Dependency Parsing
Nested event structures are a common occurrence in both open domain and domain specific extraction tasks, e.g., a “crime” event can cause a “investigation” event, which c...
David McClosky, Mihai Surdeanu, Christopher D. Man...
SIAMDM
2008
99views more  SIAMDM 2008»
13 years 10 months ago
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees
We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtree...
Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer
ICDE
2010
IEEE
272views Database» more  ICDE 2010»
14 years 10 months ago
SMARTINT: A System for Answering Queries over Web Databases Using Attribute Dependencies
Many web databases can be seen as providing partial and overlapping information about entities in the world. To answer queries effectively, we need to integrate the information abo...
Ravi Gummadi, Anupam Khulbe, Aravind Kalavagattu, ...
ACL
2011
13 years 2 months ago
Joint Training of Dependency Parsing Filters through Latent Support Vector Machines
Graph-based dependency parsing can be sped up significantly if implausible arcs are eliminated from the search-space before parsing begins. State-of-the-art methods for arc filt...
Colin Cherry, Shane Bergsma