10608 search results - page 101 / 2122 » Complexity of O'Hara's Algorithm |
VISUALIZATION
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper presents a novel algorithm combining view-dependent rendering and conservative occlusion culling for interactive display of complex environments. A vertex hierarchy of ...
SI3D
2003
ACM
14 years 3 months ago
2003
ACM
: We present occlusion-switches for interactive visibility culling in complex 3D environments. An occlusionswitch consists of two GPUs (graphics processing units) and each GPU is u...
ICIP
2000
IEEE
14 years 2 months ago
2000
IEEE
Efficient compression algorithms generally use wavelet transforms. They try to exploit all the signal dependencies that can appear inside and across the different sub-bands of th...
INFOCOM
1995
IEEE
14 years 1 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
CPM
2008
Springer
13 years 12 months ago
2008
Springer
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...