15033 search results - page 383 / 3007 » Complexity Theory and Algorithms |
191
click to vote
ICCSA
2007
Springer
16 years 1 months ago
2007
Springer
Ubiquitous multimedia services are emerging to be available at anytime and anywhere using a variety of computing devices. In this paper, we propose a low-complexity unequal loss pr...
234
click to vote
VISUALIZATION
2003
IEEE
16 years 22 days 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 ...
220
Voted
SI3D
2003
ACM
16 years 21 days 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...
229
click to vote
ICIP
2000
IEEE
15 years 12 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...
217
Voted
INFOCOM
1995
IEEE
15 years 11 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...