Sciweavers

6299 search results - page 1202 / 1260
» Data and Computation Abstractions for Dynamic and Irregular ...
Sort
View
IWCIA
2009
Springer
16 years 15 days ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...
ICCS
2007
Springer
16 years 3 days ago
Characterizing Implications of Injective Partial Orders
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
José L. Balcázar, Gemma C. Garriga
WMPI
2004
ACM
15 years 11 months ago
A compressed memory hierarchy using an indirect index cache
Abstract. The large and growing impact of memory hierarchies on overall system performance compels designers to investigate innovative techniques to improve memory-system efficienc...
Erik G. Hallnor, Steven K. Reinhardt
ICFP
1999
ACM
15 years 10 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
15 years 10 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
« Prev « First page 1202 / 1260 Last » Next »