903 search results - page 27 / 181 » Non-well-founded trees in categories |
111
click to vote
JACM
2010
14 years 10 months ago
2010
clustering of documents according to sharing of topics at multiple levels of abstraction. Given a corpus of documents, a posterior inference algorithm finds an approximation to a ...
75
Voted
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
This paper presents Dynamic IPL B+ -tree (d-IPL in short) as a B+ -tree index variant for flash-based storage systems. The d-IPL B+ -tree adopts a dynamic In-Page Logging (IPL) s...
103
click to vote
KDD
2007
ACM
16 years 5 days ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
112
click to vote
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
GLVLSI
2009
IEEE
15 years 3 months ago
2009
IEEE
1 Soft errors caused by cosmic particles and radiation emitted by the packaging are an important problem in contemporary microprocessors. Parity bits are used to detect single bit ...