7129 search results - page 744 / 1426 » Approximation Algorithms for Treewidth |
170
click to vote
COMPGEOM
2006
ACM
16 years 29 days ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
180
click to vote
SI3D
2006
ACM
16 years 28 days ago
2006
ACM
Shadow maps are a widely used shadowing technique in real time graphics. One major drawback of their use is that they cannot be filtered in the same way as color textures, typica...
186
click to vote
RTSS
2005
IEEE
16 years 16 days ago
2005
IEEE
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
190
click to vote
ESA
2005
Springer
16 years 15 days ago
2005
Springer
Let A and B be two sets of m resp. n weighted points in the plane, with m ≤ n. We present (1 + ) and (2+ )-approximation algorithms for the minimum Euclidean Earth Mover’s Dis...
167
click to vote
ICIAR
2005
Springer
16 years 14 days ago
2005
Springer
In this study, we propose two algorithms for measuring the distance between shape boundaries. In the algorithms, shape boundary is represented by the Beam Angle Statistics (BAS), w...