71 search results - page 9 / 15 » On the Complexity of Reliable Root Approximation |
SIGGRAPH
1992
ACM
13 years 11 months ago
1992
ACM
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
AVSS
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper presents a novel method for illuminationinvariant and contrast preserving feature extraction, aimed at improving performance of tracking under complex light condition. ...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
Correctness is a paramount attribute of any microprocessor design; however, without novel technologies to tame the increasing complexity of design verification, the amount of bugs...
ICMCS
2008
IEEE
14 years 2 months ago
2008
IEEE
– Nowadays, the Internet provides a convenient medium for sharing complex 3D models online. However, transmitting 3D progressive meshes over networks may encounter the problem of...
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...