Sciweavers

1302 search results - page 95 / 261
» On the Strong Chromatic Number
Sort
View
JCST
2008
119views more  JCST 2008»
15 years 6 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
IPL
2006
110views more  IPL 2006»
15 years 6 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway
JCNS
2000
73views more  JCNS 2000»
15 years 6 months ago
Models of Calmodulin Trapping and CaM Kinase II Activation in a Dendritic Spine
Activation of calcium/calmodulin-dependent protein kinase II (CaMKII) by calmodulin following calcium entry into the cell is important for long-term potentiation (LTP). Here a mode...
William Holmes
JSYML
2010
107views more  JSYML 2010»
15 years 4 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
POPL
2011
ACM
14 years 9 months ago
Safe nondeterminism in a deterministic-by-default parallel language
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...