Sciweavers

129 search results - page 24 / 26
» arc 2010
Sort
View
NAACL
2010
13 years 6 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
MICS
2010
128views more  MICS 2010»
13 years 3 months ago
Arrangements on Parametric Surfaces II: Concretizations and Applications
We describe the algorithms and implementation details involved in the concretizations of a generic framework that enables exact construction, maintenance, and manipulation of arran...
Eric Berberich, Efi Fogel, Dan Halperin, Michael K...
IPCO
2010
125views Optimization» more  IPCO 2010»
13 years 10 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
BMCBI
2010
98views more  BMCBI 2010»
13 years 8 months ago
An optimized TOPS+ comparison method for enhanced TOPS models
nd: Although methods based on highly abstract descriptions of protein structures, such as VAST and TOPS, can perform very fast protein structure comparison, the results can lack a...
Mallika Veeramalai, David Gilbert, Gabriel Valient...
EM
2010
155views Management» more  EM 2010»
13 years 8 months ago
Hyperbolic Graphs of Small Complexity
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
Damian Heard, Craig Hodgson, Bruno Martelli, Carlo...