134 search results - page 27 / 27 » On the Complexity of Approximating the VC Dimension |
AMAI
2007
Springer
13 years 5 months ago
2007
Springer
Relational datasets, i.e., datasets in which individuals are described both by their own features and by their relations to other individuals, arise from various sources such as d...
BMCBI
2010
13 years 5 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
TOG
2008
13 years 4 months ago
2008
Our goal is to simulate the full hair geometry, consisting of approximately one hundred thousand hairs on a typical human head. This will require scalable methods that can simulat...
ASIACRYPT
2010
Springer
13 years 2 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...