Sciweavers

562 search results - page 18 / 113
» Ordered Sets in the Calculus of Data Structures
Sort
View
FSEN
2007
Springer
15 years 1 months ago
Test Selection Criteria for Quantifier-Free First-Order Specifications
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulae. Test cases are modeled as ground formulae and any spe...
Marc Aiguier, Agnès Arnould, Pascale Le Gal...
COMPGEOM
2010
ACM
15 years 2 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
69
Voted
JFP
2006
88views more  JFP 2006»
14 years 9 months ago
Type-based confinement
Confinement properties impose a structure on object graphs which can be used to enforce encapsulation properties. From a practical point of view, encapsulation is essential for bu...
Tian Zhao, Jens Palsberg, Jan Vitek
KES
2007
Springer
15 years 3 months ago
Models for Identifying Structures in the Data: A Performance Comparison
This paper reports on the unsupervised analysis of seismic signals recorded in Italy, respectively on the Vesuvius volcano, located in Naples, and on the Stromboli volcano, located...
Anna Esposito, Antonietta M. Esposito, Flora Giudi...
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
15 years 6 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno