159 search results - page 13 / 32 » Geometric Bounds for Generalization in Boosting |
PAMI
2008
13 years 7 months ago
2008
In this paper, we present a general guideline to find a better distance measure for similarity estimation based on statistical analysis of distribution models and distance function...
21
Voted
DAGSTUHL
2003
13 years 8 months ago
2003
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
COMPGEOM
2009
ACM
14 years 2 days ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
A kernel over the Boolean domain is said to be reflection-invariant, if its value does not change when we flip the same bit in both arguments. (Many popular kernels have this prop...