Sciweavers

8768 search results - page 31 / 1754
» Generalizing the notion of support
Sort
View
JCST
2008
119views more  JCST 2008»
15 years 1 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
CORR
2010
Springer
83views Education» more  CORR 2010»
15 years 16 days ago
Multitriangulations, pseudotriangulations and primitive sorting networks
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
Vincent Pilaud, Michel Pocchiola
COORDINATION
2007
Springer
15 years 8 months ago
Generalized Committed Choice
We present a generalized committed choice construct for concurrent programs that interact with a shared store. The generalized committed choice (GCC) allows multiple computations ...
Joxan Jaffar, Roland H. C. Yap, Kenny Qili Zhu
SAT
2007
Springer
96views Hardware» more  SAT 2007»
15 years 8 months ago
From Idempotent Generalized Boolean Assignments to Multi-bit Search
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
Marijn Heule, Hans van Maaren
FOGA
2007
15 years 3 months ago
Saddles and Barrier in Landscapes of Generalized Search Operators
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes de...
Christoph Flamm, Ivo L. Hofacker, Bärbel M. R...