Sciweavers

522 search results - page 14 / 105
» The 3-Steiner Root Problem
Sort
View
TABLEAUX
2000
Springer
14 years 5 days ago
Matrix-Based Inductive Theorem Proving
We present an approach to inductive theorem proving that integrates rippling-based rewriting into matrix-based logical proof search. The selection of appropriate connections in a m...
Christoph Kreitz, Brigitte Pientka
EMNLP
2007
13 years 10 months ago
A Two-Stage Parser for Multilingual Dependency Parsing
We present a two-stage multilingual dependency parsing system submitted to the Multilingual Track of CoNLL-2007. The parser first identifies dependencies using a deterministic p...
Wenliang Chen, Yujie Zhang, Hitoshi Isahara
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 6 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
IPCO
2007
94views Optimization» more  IPCO 2007»
13 years 10 months ago
Infrastructure Leasing Problems
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
Barbara M. Anthony, Anupam Gupta
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 10 months ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su