Sciweavers

1923 search results - page 237 / 385
» Weighted Decision Trees
Sort
View
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
15 years 10 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
ACL
2006
15 years 8 months ago
Optimal Constituent Alignment with Edge Covers for Semantic Projection
Given a parallel corpus, semantic projection attempts to transfer semantic role annotations from one language to another, typically by exploiting word alignments. In this paper, w...
Sebastian Padó, Mirella Lapata
EACL
2006
ACL Anthology
15 years 7 months ago
Discriminative Sentence Compression with Soft Syntactic Evidence
We present a model for sentence compression that uses a discriminative largemargin learning framework coupled with a novel feature set defined on compressed bigrams as well as dee...
Ryan T. McDonald
CORR
2010
Springer
126views Education» more  CORR 2010»
15 years 6 months ago
Towards Providing Low-Risk and Economically Feasible Network Data Transfer Services
: - In the first part of this paper we present the first steps towards providing low-risk and economically feasible network data transfer services. We introduce three types of data...
Mugurel Ionut Andreica, Vasile Deac, Stelian Tipa
DISOPT
2010
132views more  DISOPT 2010»
15 years 6 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...