1552 search results - page 11 / 311 » On the Complexity of Constant Propagation |
CG
2000
Springer
14 years 9 months ago
2000
Springer
This paper is devoted to a designer tool, which is an extension of particle tracing algorithm for analysis of scenes, artifacts, image ghosts, and ray tracing mechanism itself. Th...
77
Voted
ALENEX
2004
14 years 11 months ago
2004
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among ...
GD
2003
Springer
15 years 2 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
AMDO
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. In this paper, we present a novel, fast, resolution-independent silhouette area-based matching approach. We approximate the silhouette area by a small set of axis-aligned...