Sciweavers

389 search results - page 74 / 78
» Some natural decision problems in automatic graphs
Sort
View
DAC
1994
ACM
13 years 10 months ago
A Communicating Petri Net Model for the Design of Concurrent Asynchronous Modules
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...
Gjalt G. de Jong, Bill Lin
ACL
1997
13 years 8 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
TSD
2010
Springer
13 years 5 months ago
Evaluation of a Sentence Ranker for Text Summarization Based on Roget's Thesaurus
Abstract. Evaluation is one of the hardest tasks in automatic text summarization. It is perhaps even harder to determine how much a particular component of a summarization system c...
Alistair Kennedy, Stan Szpakowicz
EMNLP
2009
13 years 4 months ago
Parser Adaptation and Projection with Quasi-Synchronous Grammar Features
We connect two scenarios in structured learning: adapting a parser trained on one corpus to another annotation style, and projecting syntactic annotations from one language to ano...
David A. Smith, Jason Eisner
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 7 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen