7006 search results - page 160 / 1402 » Approximation Algorithms |
CORR
2006
Springer
15 years 2 months ago
2006
Springer
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
117
click to vote
COMPGEOM
2001
ACM
15 years 6 months ago
2001
ACM
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
123
click to vote
ALGORITHMICA
2005
15 years 2 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
113
click to vote
IPL
2008
15 years 2 months ago
2008
Let P be a convex polytope in Rd , d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm select...
110
click to vote
FUZZIEEE
2007
IEEE
15 years 9 months ago
2007
IEEE
— Reinforcement learning (RL) is a learning control paradigm that provides well-understood algorithms with good convergence and consistency properties. Unfortunately, these algor...