Sciweavers

206 search results - page 7 / 42
» Three Heads are Better than One
Sort
View
SIGGRAPH
1993
ACM
15 years 1 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
PVLDB
2010
150views more  PVLDB 2010»
14 years 8 months ago
Tree Indexing on Solid State Drives
Large flash disks, or solid state drives (SSDs), have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption a...
Yinan Li, Bingsheng He, Jun Yang 0001, Qiong Luo, ...
ICPR
2004
IEEE
15 years 10 months ago
Evaluation of Tracking Reliability Metrics based on Information Theory and Normalized Correlation
The efficiency of three tracking reliability metrics based on information theory and normalized correlation is examined in this paper. The two information theory tools used for th...
Evangelos Loutas, Nikos Nikolaidis, Ioannis Pitas
CONNECTION
2004
92views more  CONNECTION 2004»
14 years 9 months ago
High capacity associative memories and connection constraints
: High capacity associative neural networks can be built from networks of perceptrons, trained using simple perceptron training. Such networks perform much better than those traine...
Neil Davey, Rod Adams
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
14 years 10 months ago
Accelerating genetic programming by frequent subtree mining
One crucial issue in genetic programming (GP) is how to acquire promising building blocks efficiently. In this paper, we propose a GP method (called GPTM, GP with Tree Mining) whi...
Yoshitaka Kameya, Junichi Kumagai, Yoshiaki Kurata