2836 search results - page 313 / 568 » Parsing Algorithms and Metrics |
244
Voted
EMNLP
2011
14 years 7 months ago
2011
In this paper, we propose a novel approach to automatic generation of aspect-oriented summaries from multiple documents. We first develop an event-aspect LDA model to cluster sen...
189
click to vote
COMPGEOM
2009
ACM
16 years 2 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
247
click to vote
STACS
2005
Springer
16 years 1 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
325
click to vote
SGAI
2010
Springer
15 years 5 months ago
2010
Springer
The Prism family of algorithms induces modular classification rules which, in contrast to decision tree induction algorithms, do not necessarily fit together into a decision tree s...
240
click to vote
COMPGEOM
1992
ACM
15 years 11 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...