1554 search results - page 61 / 311 » Parameterized Complexity and Approximation Algorithms |
161
click to vote
ECCC
2011
14 years 11 months ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
136
Voted
SIAMCOMP
2000
15 years 4 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
161
click to vote
JMLR
2010
14 years 11 months ago
2010
We address an approximation method for Gaussian process (GP) regression, where we approximate covariance by a block matrix such that diagonal blocks are calculated exactly while o...
171
Voted
SMI
2006
IEEE
15 years 10 months ago
2006
IEEE
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
110
click to vote
CRYPTO
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...