2168 search results - page 243 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
156
click to vote
COLING
2010
14 years 11 months ago
2010
This paper addresses the problem of dynamic model parameter selection for loglinear model based statistical machine translation (SMT) systems. In this work, we propose a principle...
165
Voted
ACL
2011
14 years 8 months ago
2011
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
138
click to vote
EUROPAR
2011
Springer
14 years 4 months ago
2011
Springer
DOALL loops are tiled to exploit DOALL parallelism and data locality on GPUs. In contrast, due to loop-carried dependences, DOACROSS loops must be skewed first in order to make ti...
161
click to vote
WCNC
2010
IEEE
15 years 8 months ago
2010
IEEE
—This paper considers the tradeoff between bursty and continuous transmissions in wireless ad hoc networks. In our network model, packets belonging to specific transmitters arri...
165
click to vote
IROS
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— Robust vision-based grasping is still a hard problem for humanoid robot systems. When being restricted to using the camera system built-in into the robot’s head for o...