Sciweavers

1241 search results - page 127 / 249
» Path-oriented random testing
Sort
View
RCIS
2010
15 years 25 days ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
BMCBI
2011
14 years 9 months ago
Empirical Bayesian models for analysing molecular serotyping microarrays
Background: Microarrays offer great potential as a platform for molecular diagnostics, testing clinical samples for the presence of numerous biomarkers in highly multiplexed assay...
Richard Newton, Jason Hinds, Lorenz Wernisch
KDD
2012
ACM
199views Data Mining» more  KDD 2012»
13 years 4 months ago
Trustworthy online controlled experiments: five puzzling outcomes explained
Online controlled experiments are often utilized to make datadriven decisions at Amazon, Microsoft, eBay, Facebook, Google, Yahoo, Zynga, and at many other companies. While the th...
Ron Kohavi, Alex Deng, Brian Frasca, Roger Longbot...
CVPR
2012
IEEE
13 years 4 months ago
Weakly supervised structured output learning for semantic segmentation
We address the problem of weakly supervised semantic segmentation. The training images are labeled only by the classes they contain, not by their location in the image. On test im...
Alexander Vezhnevets, Vittorio Ferrari, Joachim M....
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
16 years 3 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...