Sciweavers

270 search results - page 28 / 54
» Generation From Under - And Overspecified Structures
Sort
View
FOCS
2010
IEEE
14 years 9 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan
103
Voted
ICIP
2001
IEEE
16 years 20 days ago
DWT based non-parametric texture modeling
We propose a non-parametric texture modeling and synthesis technique based on the integer version of the Discrete Wavelet Transform (DWT). The successive levels of the DWT pyramid...
Gloria Menegaz
ICDIM
2007
IEEE
15 years 5 months ago
Pattern-based decision tree construction
Learning classifiers has been studied extensively the last two decades. Recently, various approaches based on patterns (e.g., association rules) that hold within labeled data hav...
Dominique Gay, Nazha Selmaoui, Jean-Françoi...
ISSTA
2006
ACM
15 years 5 months ago
Coverage metrics for requirements-based testing
In black-box testing, one is interested in creating a suite of tests from requirements that adequately exercise the behavior of a software system without regard to the internal st...
Michael W. Whalen, Ajitha Rajan, Mats Per Erik Hei...
JMLR
2006
118views more  JMLR 2006»
14 years 11 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng