2969 search results - page 403 / 594 » A space efficient algorithm for group structure computation |
158
click to vote
VG
2001
15 years 6 months ago
2001
In this paper we describe an efficient approach to add shadows to volumetric scenes. The light emitted by the lightsource is properly attenuated by the intervening volumetric struc...
245
click to vote
GIS
2004
ACM
16 years 6 months ago
2004
ACM
Spatial co-location patterns represent the subsets of events whose instances are frequently located together in geographic space. We identified the computational bottleneck in the...
147
Voted
IAJIT
2010
15 years 3 months ago
2010
: The coding gain of the H.264/AVC video encoder mainly comes from the new incorporated prediction tools. However, their enormous computation and ultrahigh memory bandwidth are the...
139
Voted
CGF
2008
15 years 5 months ago
2008
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
137
click to vote
GLVLSI
2003
IEEE
15 years 10 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...