Sciweavers

4372 search results - page 375 / 875
» Algorithmic Theories of Everything
Sort
View
SPAA
2009
ACM
16 years 7 months ago
On avoiding spare aborts in transactional memory
This paper takes a step toward developing a theory for understanding aborts in transactional memory systems (TMs). Existing TMs may abort many transactions that could, in fact, co...
Idit Keidar, Dmitri Perelman
KDD
2006
ACM
123views Data Mining» more  KDD 2006»
16 years 7 months ago
Mining rank-correlated sets of numerical attributes
We study the mining of interesting patterns in the presence of numerical attributes. Instead of the usual discretization methods, we propose the use of rank based measures to scor...
Toon Calders, Bart Goethals, Szymon Jaroszewicz
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
16 years 7 months ago
Identifying bridging rules between conceptual clusters
1 A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a dat...
Shichao Zhang, Feng Chen, Xindong Wu, Chengqi Zhan...
CADE
2003
Springer
16 years 7 months ago
Certifying Solutions to Permutation Group Problems
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
Arjeh M. Cohen, Scott H. Murray, Martin Pollet, Vo...
STOC
2005
ACM
104views Algorithms» more  STOC 2005»
16 years 7 months ago
Beyond NP: the work and legacy of Larry Stockmeyer
Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...
Lance Fortnow