Sciweavers

2180 search results - page 29 / 436
» Algorithms for discovering bucket orders from data
Sort
View
PAKDD
2009
ACM
170views Data Mining» more  PAKDD 2009»
14 years 5 months ago
Discovering Periodic-Frequent Patterns in Transactional Databases.
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based...
Byeong-Soo Jeong, Chowdhury Farhan Ahmed, Syed Kha...
KBSE
2005
IEEE
14 years 2 months ago
Optimized run-time race detection and atomicity checking using partial discovered types
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. Two common kinds of concurrency errors are data races and atomicity violation...
Rahul Agarwal, Amit Sasturkar, Liqiang Wang, Scott...
POPL
2003
ACM
14 years 8 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
NAR
2010
123views more  NAR 2010»
13 years 3 months ago
Discovering causal signaling pathways through gene-expression patterns
High-throughput gene-expression studies result in lists of differentially expressed genes. Most current meta-analyses of these gene lists include searching for significant members...
Jignesh R. Parikh, Bertram Klinger, Yu Xia, Jarrod...
PAKDD
2000
ACM
100views Data Mining» more  PAKDD 2000»
14 years 1 days ago
Discovery of Relevant Weights by Minimizing Cross-Validation Error
In order to discover relevant weights of neural networks, this paper proposes a novel method to learn a distinct squared penalty factor for each weight as a minimization problem ov...
Kazumi Saito, Ryohei Nakano