874 search results - page 6 / 175 » Faster Algorithms for Semi-Matching Problems |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We present new faster algorithms for the exact solution of the shortest vector problem in arbitrary lattices. Our main result shows that the shortest vector in any n-dimensional l...
STOC
2010
ACM
14 years 11 days ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
WEA
2004
Springer
14 years 25 days ago
2004
Springer
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
MST
2007
13 years 7 months ago
2007
ACL
2007
13 years 9 months ago
2007
Efficient decoding has been a fundamental problem in machine translation, especially with an integrated language model which is essential for achieving good translation quality. ...