22 search results - page 3 / 5 » Building Up Rhetorical Structure Trees |
IPPS
2003
IEEE
13 years 10 months ago
2003
IEEE
Clustering, or unsupervised classification, has many uses in fields that depend on grouping results from large amount of data, an example being the N-body cosmological simulation ...
VLDB
1999
ACM
13 years 9 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
EGH
2010
Springer
13 years 3 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
DATE
2009
IEEE
14 years 1 days ago
2009
IEEE
— This paper introduces a graph grammar based approach to automated topology synthesis of analog circuits. A grammar is developed to generate circuits through production rules, t...
ISAAC
2001
Springer
13 years 9 months ago
2001
Springer
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...