1554 search results - page 61 / 311 » Parameterized Complexity and Approximation Algorithms |
141
click to vote
ECCC
2011
14 years 9 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...
123
Voted
SIAMCOMP
2000
15 years 2 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...
138
Voted
JMLR
2010
14 years 9 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...
154
Voted
SMI
2006
IEEE
15 years 8 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...
CRYPTO
2004
Springer
15 years 8 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...