5 search results - page 1 / 1 » Heuristic Cube Pruning in Linear Time |
ACL
2012
11 years 7 months ago
2012
We propose a novel heuristic algorithm for Cube Pruning running in linear time in the beam size. Empirically, we show a gain in running time of a standard machine translation syst...
INFORMS
2010
13 years 3 months ago
2010
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...
VLDB
2005
ACM
13 years 10 months ago
2005
ACM
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
TKDE
2010
13 years 3 months ago
2010
—Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to “certain” data, the ...
ICCV
2001
IEEE
14 years 6 months ago
2001
IEEE
Window size and shape selection is a difficult problem in area based stereo. We propose an algorithm which chooses an appropriate window shape by optimizing over a large class of ...