Sciweavers

1243 search results - page 26 / 249
» Generating Trees on Multisets
Sort
View
CAV
2010
Springer
192views Hardware» more  CAV 2010»
14 years 1 months ago
Invariant Synthesis for Programs Manipulating Lists with Unbounded Data
We address the issue of automatic invariant synthesis for sequential programs manipulating singly-linked lists carrying data over infinite data doe define for that a framework ba...
Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, A...
DCC
1998
IEEE
14 years 2 months ago
The Context Trees of Block Sorting Compression
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
N. Jesper Larsson
AUSDM
2006
Springer
114views Data Mining» more  AUSDM 2006»
14 years 1 months ago
Consolidated Trees: An Analysis of Structural Convergence
When different subsamples of the same data set are used to induce classification trees, the structure of the built classifiers is very different. The stability of the structure of ...
Jesús M. Pérez, Javier Muguerza, Ola...
ALGORITHMICA
2006
90views more  ALGORITHMICA 2006»
13 years 10 months ago
Destruction of Very Simple Trees
We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple trees (which include ordered trees, d-ary trees, and Cayley trees); th...
James Allen Fill, Nevin Kapur, Alois Panholzer
IS
2008
13 years 9 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth