Sciweavers

17760 search results - page 65 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
FLAIRS
2008
15 years 3 months ago
Unsupervised Learning of General-Specific Noun Relations from the Web
In this paper, we propose a new methodology based on directed weighted graphs and the TextRank algorithm to automatically induce general-specific noun relations from web corpora f...
Gaël Dias, Raycho Mukelov, Guillaume Cleuziou
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
15 years 3 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz
EKAW
2008
Springer
15 years 3 months ago
Mapping General-Specific Noun Relationships to WordNet Hypernym/Hyponym Relations
In this paper, we propose a new methodology based on directed graphs and the TextRank algorithm to automatically induce general-specific noun relations from web corpora frequency c...
Gaël Dias, Raycho Mukelov, Guillaume Cleuziou
AAAI
2004
15 years 2 months ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003
AAAI
1994
15 years 2 months ago
L* Parsing: A General Framework for Syntactic Analysis of Natural Language
We describe a new algorithm for table-driven parsing with context-free grammars designed to support efficient syntactic analysis of natural language. The algorithm provides a gene...
Eric K. Jones, Linton M. Miller