1920 search results - page 83 / 384 » The Complexity of the A B C Problem |
167
click to vote
NAACL
2010
15 years 4 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 ...
146
click to vote
WSC
2000
15 years 7 months ago
2000
One of the approaches to modeling hybrid systems is to assign algebraic-differential equations describing the continuous behavior to states of state machines that represent discre...
142
click to vote
JSW
2008
15 years 6 months ago
2008
Image inpainting technique is that repairs damaged area or remove areas in an image. In order to deal with this kind of problems, not only a robust image inpainting algorithm shoul...
182
Voted
ECCC
2010
15 years 1 months ago
2010
We present an alternate proof of the recent result by Gutfreund and Kawachi that derandomizing Arthur-Merlin games into PNP implies linear-exponential circuit lower bounds for ENP...
155
click to vote
MP
2011
15 years 1 months ago
2011
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...