Sciweavers

158 search results - page 18 / 32
» Some counting problems related to permutation groups
Sort
View
CORR
2008
Springer
87views Education» more  CORR 2008»
15 years 1 months ago
Two-Level Concept-Oriented Data Model
In this paper we describe a new approach to data modelling called the concept-oriented model (CoM). This model is based on the formalism of nested ordered sets which uses inclusion...
Alexandr A. Savinov
DAGSTUHL
2007
15 years 2 months ago
Note on parallel universes
The parallel universes idea is an attempt to integrate several aspects of learning which share some common aspects. This is an interesting idea: if successful, insights could cross...
Niall M. Adams, David J. Hand
DM
2006
128views more  DM 2006»
15 years 1 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
CPM
2006
Springer
107views Combinatorics» more  CPM 2006»
15 years 5 months ago
Tiling an Interval of the Discrete Line
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
Olivier Bodini, Eric Rivals
FIMI
2003
210views Data Mining» more  FIMI 2003»
15 years 2 months ago
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
Osmar R. Zaïane, Mohammad El-Hajj