Sciweavers

7930 search results - page 1202 / 1586
» Greedy in Approximation Algorithms
Sort
View
SIGGRAPH
2010
ACM
15 years 11 months ago
Interactive hair rendering under environment lighting
We present an algorithm for interactive hair rendering with both single and multiple scattering effects under complex environment lighting. The outgoing radiance due to single sca...
Zhong Ren, Kun Zhou, Tengfei Li, Wei Hua, Baining ...
IPPS
2000
IEEE
15 years 11 months ago
Reduction Optimization in Heterogeneous Cluster Environments
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
Pangfeng Liu, Da-Wei Wang
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
15 years 11 months ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
SIGGRAPH
1998
ACM
15 years 11 months ago
Progressive Forest Split Compression
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...
Gabriel Taubin, André Guéziec, Willi...
ISPD
1997
ACM
68views Hardware» more  ISPD 1997»
15 years 11 months ago
Faster minimization of linear wirelength for global placement
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huan...
« Prev « First page 1202 / 1586 Last » Next »