2957 search results - page 150 / 592 » The Complexity of Polynomial-Time Approximation |
136
Voted
GRAPHICSINTERFACE
1996
15 years 6 months ago
1996
We present a new method for accelerating the rendering of complex static scenes. The technique is applicable to unstructured scenes containing arbitrary geometric primitives and h...
136
click to vote
ICPR
2008
IEEE
16 years 6 months ago
2008
IEEE
The loss of information due to occlusion and other complications has been one of the main bottlenecks in the field of motion estimation. In this paper, we propose a novel motion e...
136
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
157
click to vote
PODS
2008
ACM
16 years 5 months ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
86
Voted
IPPS
2006
IEEE
15 years 11 months ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...