Sciweavers

1594 search results - page 122 / 319
» Fast Prediction on a Tree
Sort
View
ECML
1997
Springer
14 years 10 days ago
Global Data Analysis and the Fragmentation Problem in Decision Tree Induction
We investigate an inherent limitation of top-down decision tree induction in which the continuous partitioning of the instance space progressively lessens the statistical support o...
Ricardo Vilalta, Gunnar Blix, Larry A. Rendell
ACL
2006
13 years 9 months ago
A Comparison of Alternative Parse Tree Paths for Labeling Semantic Roles
The integration of sophisticated inference-based techniques into natural language processing applications first requires a reliable method of encoding the predicate-argument struc...
Reid Swanson, Andrew S. Gordon
EDBT
2006
ACM
159views Database» more  EDBT 2006»
14 years 8 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
14 years 2 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...
ICC
2009
IEEE
136views Communications» more  ICC 2009»
14 years 2 months ago
Fast Connected Dominating Set Construction in Mobile Ad Hoc Networks
—The connected dominating set (CDS) has been commonly used for routing and broadcast in mobile ad hoc networks (MANETs). Considering the applications of MANETs, it is generally p...
Kazuya Sakai, Min-Te Sun, Wei-Shinn Ku