2200 search results - page 371 / 440 » Bloch's Constant is Computable |
155
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
178
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
157
click to vote
DAC
2003
ACM
15 years 11 months ago
2003
ACM
This paper presents an analytical framework for the implementation of digital infinite impulse response filters in fixed-point hardware on field programmable gate arrays. This ana...
155
click to vote
SI3D
2003
ACM
15 years 11 months ago
2003
ACM
Interruptible rendering is a novel approach to the fidelity-versusperformance tradeoff ubiquitous in real-time rendering. Interruptible rendering unifies spatial error, caused by ...
202
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...