720 search results - page 40 / 144 » Linear k-arboricities on trees |
CCCG
1998
13 years 10 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
IPM
2008
13 years 8 months ago
2008
Extracting semantic relationships between entities from text documents is challenging in information extraction and important for deep information processing and management. This ...
STOC
1994
ACM
14 years 22 days ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper presents a method to speed up support vector classification, especially important when data is highdimensional. Unlike previous approaches which focus on less support v...
NAACL
2007
13 years 10 months ago
2007
We present a revision learning model for improving the accuracy of a dependency parser. The revision stage corrects the output of the base parser by means of revision rules learne...