Sciweavers

17770 search results - page 89 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
15 years 4 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
108
Voted
EKAW
2008
Springer
15 years 4 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
120
Voted
AAAI
2004
15 years 4 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 4 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
117
Voted
GD
2008
Springer
15 years 3 months ago
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...
Seok-Hee Hong, Martin Mader