1518 search results - page 65 / 304 » Exact and Approximate Bandwidth |
ALGORITHMICA
2005
14 years 9 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
—Several dynamic call admission control (CAC) schemes for cellular networks have been proposed in the literature to reserve resources adaptively to provide the desired quality of...
WG
2007
Springer
15 years 3 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
NIPS
2007
14 years 11 months ago
2007
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...