Sciweavers

1554 search results - page 267 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
SIGGRAPH
2010
ACM
15 years 2 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 ...
89
Voted
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
15 years 2 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
100
Voted
SIGGRAPH
1998
ACM
15 years 2 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...
104
Voted
SIGGRAPH
1997
ACM
15 years 1 months ago
View-dependent refinement of progressive meshes
Level-of-detail (LOD) representations are an important tool for realtime rendering of complex geometric environments. The previously introduced progressive mesh representation def...
Hugues Hoppe
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
15 years 10 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu