134 search results - page 16 / 27 » On the Complexity of Approximating the VC Dimension |
ISSAC
2009
Springer
15 years 6 months ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
106
Voted
ATAL
2009
Springer
14 years 9 months ago
2009
Springer
Today's society is largely connected and many real life applications lend themselves to be modeled as multi-agent systems. Although such systems as well as their models are d...
123
Voted
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
104
click to vote
CCGRID
2002
IEEE
15 years 4 months ago
2002
IEEE
A scalable and expressive peer-to-peer (P2P) networking and computing framework requires efficient resource discovery services. Here we propose NEVRLATE, for Network-Efficient V...
CMA
2010
14 years 9 months ago
2010
Abstract. Previous work [51] showed how to solve time-fractional diffusion equations by particle tracking. This paper extends the method to the case where the order of the fraction...