4908 search results - page 303 / 982 » On the Complexity of Optimal K-Anonymity |
143
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
193
click to vote
WSC
2004
15 years 8 months ago
2004
Nowadays, in a hotly competitive environment, companies are continuously trying to provide products and/or services to customers faster, cheaper, and better than the competitors d...
172
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Identifying functional elements, such as transcriptional factor binding sites, is a fundamental step in reconstructing gene regulatory networks and remains a challengi...
173
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we consider an automatic-repeat-request (ARQ) retransmission protocol signaling over a block-fading multiple-input, multiple-output (MIMO) channel. Unlike previous ...
208
click to vote
PAMI
2008
15 years 6 months ago
2008
In previous optimization-based methods of 3D planar-faced object reconstruction from single 2D line drawings, the missing depths of the vertices of a line drawing (and other parame...