Sciweavers

8094 search results - page 106 / 1619
» Improvements in Formula Generalization
Sort
View
ACL
2007
13 years 10 months ago
Generalizing Tree Transformations for Inductive Dependency Parsing
Previous studies in data-driven dependency parsing have shown that tree transformations can improve parsing accuracy for specific parsers and data sets. We investigate to what ex...
Jens Nilsson, Joakim Nivre, Johan Hall
LREC
2010
156views Education» more  LREC 2010»
13 years 10 months ago
A General Method for Creating a Bilingual Transliteration Dictionary
Transliteration is the rendering in one language of terms from another language (and, possibly, another writing system), approximating spelling and/or phonetic equivalents between...
Amit Kirschenbaum, Shuly Wintner
OPODIS
2001
13 years 10 months ago
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
Lélia Blin, Franck Butelle
IPCO
1998
152views Optimization» more  IPCO 1998»
13 years 10 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
WSC
1998
13 years 10 months ago
Using ACCESSIBILITY to Assess the Performance of Generalized Hill Climbing Algorithms
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
Sheldon H. Jacobson, Enver Yücesan