9176 search results - page 524 / 1836 » algorithms 2010 |
163
click to vote
ACL
2010
15 years 5 months ago
2010
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...
161
click to vote
COLING
2010
15 years 1 months ago
2010
State-of-the-art approaches for unsupervised keyphrase extraction are typically evaluated on a single dataset with a single parameter setting. Consequently, it is unclear how effe...
172
click to vote
ERCIMDL
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Collection selection is traditionally a sub-problem of metasearch, and identifies collections most likely to contain relevant documents. However, we propose to treat coll...
174
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
194
click to vote
PAKDD
2010
ACM
15 years 8 months ago
2010
ACM
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the...