Sciweavers

373 search results - page 43 / 75
» Counting in Trees for Free
Sort
View
IPPS
1997
IEEE
14 years 26 days ago
Maintaining Spatial Data Sets in Distributed-Memory Machines
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
Susanne E. Hambrusch, Ashfaq A. Khokhar
JAPLL
2006
114views more  JAPLL 2006»
13 years 8 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle
SI3D
2006
ACM
14 years 2 months ago
Abstract shade trees
Shade Trees Morgan McGuire George Stathis Hanspeter Pfister Shriram Krishnamurthi Brown University Harvard Extension School MERL Brown University As GPU-powered special effects be...
Morgan McGuire, George Stathis, Hanspeter Pfister,...
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 1 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
ICMLA
2007
13 years 10 months ago
Estimating class probabilities in random forests
For both single probability estimation trees (PETs) and ensembles of such trees, commonly employed class probability estimates correct the observed relative class frequencies in e...
Henrik Boström