Sciweavers

96 search results - page 15 / 20
» The Satisfiability Threshold for k-XORSAT
Sort
View
APWEB
2005
Springer
15 years 3 months ago
A Fast Algorithm for Mining Share-Frequent Itemsets
Itemset share has been proposed as a measure of the importance of itemsets for mining association rules. The value of the itemset share can provide useful information such as total...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
VLDB
2004
ACM
115views Database» more  VLDB 2004»
15 years 3 months ago
Semantic Mining and Analysis of Gene Expression Data
Association rules can reveal biological relevant relationship between genes and environments / categories. However, most existing association rule mining algorithms are rendered i...
Xin Xu, Gao Cong, Beng Chin Ooi, Kian-Lee Tan, Ant...
ITC
1994
IEEE
151views Hardware» more  ITC 1994»
15 years 1 months ago
Automated Logic Synthesis of Random-Pattern-Testable Circuits
Previous approaches to designing random pattern testable circuits use post-synthesis test point insertion to eliminate random pattern resistant (r.p.r.) faults. The approach taken...
Nur A. Touba, Edward J. McCluskey
65
Voted
ICDT
2010
ACM
125views Database» more  ICDT 2010»
15 years 1 months ago
Synthesizing View Definitions from Data
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
Anish Das Sarma, Aditya Parameswaran, Hector Garci...
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
15 years 1 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
Jens Groth