Sciweavers

507 search results - page 67 / 102
» Generating Better Decision Trees
Sort
View
SIGGRAPH
1993
ACM
14 years 2 months ago
Smooth transitions between bump rendering algorithms
A method is describedfor switching smoothly between rendering algorithms as required by the amount of visible surface detail. The result will be more realism with less computation...
Barry G. Becker, Nelson L. Max
IWMM
2000
Springer
108views Hardware» more  IWMM 2000»
14 years 1 months ago
Efficient Object Sampling via Weak References
The performance of automatic memory management may be improved if the policies used in allocating and collecting objects had knowledge of the lifetimes of objects. To date, approa...
Ole Agesen, Alex Garthwaite
LREC
2008
114views Education» more  LREC 2008»
13 years 11 months ago
A Study of Parentheticals in Discourse Corpora - Implications for NLG Systems
This paper presents a corpus study of parenthetical constructions in two different corpora: the Penn Discourse Treebank (PDTB, (PDTBGroup, 2008)) and the RST Discourse Treebank (C...
Eva Banik, Alan Lee
CIB
2005
101views more  CIB 2005»
13 years 10 months ago
Association-Based Segmentation for Chinese-Crossed Query Expansion
The continually and high-rate growth of China's economy has attracted more and more international investors. These investors have an urgent need of identifying patterns in Chi...
Chengqi Zhang, Zhenxing Qin, Xiaowei Yan
AAAI
2008
14 years 12 days ago
Interaction Structure and Dimensionality Reduction in Decentralized MDPs
Decentralized Markov Decision Processes are a powerful general model of decentralized, cooperative multi-agent problem solving. The high complexity of the general problem leads to...
Martin Allen, Marek Petrik, Shlomo Zilberstein