2194 search results - page 48 / 439 » Improving HLRTA*( k ) |
EMNLP
2006
14 years 12 days ago
2006
This paper demonstrates two methods to improve the performance of instancebased learning (IBL) algorithms for the problem of Semantic Role Labeling (SRL). Two IBL algorithms are u...
ECCC
2011
13 years 2 months ago
2011
Abstract. Given an LLL-basis B of dimension n = hk we accelerate slide-reduction with blocksize k to run under a reasonable assumption within 1 6 n2 h log1+ε α local SVP-computat...
SODA
1996
ACM
14 years 9 days ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
CG
2007
Springer
13 years 11 months ago
2007
Springer
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollificatio...
SODA
2003
ACM
14 years 11 days ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...