Sciweavers

1999 search results - page 17 / 400
» Finding Reductions Automatically
Sort
View
TVCG
2008
149views more  TVCG 2008»
14 years 9 months ago
Antialiasing Procedural Shaders with Reduction Maps
Both texture maps and procedural shaders suffer from rendering artifacts during minification. Unlike texture maps, there exist no good automatic method to antialias procedural shad...
R. B. Van Horn III, Greg Turk
SDM
2009
SIAM
143views Data Mining» more  SDM 2009»
15 years 6 months ago
Finding Representative Association Rules from Large Rule Collections.
One of the most well-studied problems in data mining is computing association rules from large transactional databases. Often, the rule collections extracted from existing datamin...
Warren L. Davis IV, Peter Schwarz, Evimaria Terzi
ICDM
2009
IEEE
109views Data Mining» more  ICDM 2009»
15 years 4 months ago
Finding Associations and Computing Similarity via Biased Pair Sampling
Sampling-based methods have previously been proposed for the problem of finding interesting associations in data, even for low-support items. While these methods do not guarantee ...
Andrea Campagna, Rasmus Pagh
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 4 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
ECML
2007
Springer
15 years 3 months ago
Finding the Right Family: Parent and Child Selection for Averaged One-Dependence Estimators
Averaged One-Dependence Estimators (AODE) classifies by uniformly aggregating all qualified one-dependence estimators (ODEs). Its capacity to significantly improve naive Bayes...
Fei Zheng, Geoffrey I. Webb