2168 search results - page 31 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
NAACL
2010
13 years 5 months ago
2010
Previous work on dependency parsing used various kinds of combination models but a systematic analysis and comparison of these approaches is lacking. In this paper we implemented ...
FCT
2007
Springer
13 years 11 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
BMCBI
2007
13 years 7 months ago
2007
Background: Interest is growing in the application of syntactic parsers to natural language processing problems in biology, but assessing their performance is difficult because di...
RT
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. This paper presents how the image-based rendering technique of viewdependent texture-mapping (VDTM) can be efficiently implemented using projective texture mapping, a fea...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...