Sciweavers

2168 search results - page 37 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
ACL
2012
11 years 10 months ago
A Comparative Study of Target Dependency Structures for Statistical Machine Translation
This paper presents a comparative study of target dependency structures yielded by several state-of-the-art linguistic parsers. Our approach is to measure the impact of these noni...
Xianchao Wu, Katsuhito Sudoh, Kevin Duh, Hajime Ts...
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
14 years 1 months ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
ACL
2010
13 years 5 months ago
A Probabilistic Generative Model for an Intermediate Constituency-Dependency Representation
We present a probabilistic model extension to the Tesni`ere Dependency Structure (TDS) framework formulated in (Sangati and Mazza, 2009). This representation incorporates aspects ...
Federico Sangati
DAM
2007
177views more  DAM 2007»
13 years 7 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
14 years 8 months ago
Estimating the confidence of conditional functional dependencies
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
Graham Cormode, Lukasz Golab, Flip Korn, Andrew Mc...