3244 search results - page 18 / 649 » On convex complexity measures |
103
click to vote
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
TIP
2002
14 years 11 months ago
2002
In this correspondence, we prove that the affine invariants proposed recently by Yang and Cohen [1] are algebraically dependent. We show how to select an independent and complete s...
83
Voted
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
MP
2006
14 years 11 months ago
2006
Abstract. There is a natural norm associated with a starting point of the homogeneous selfdual (HSD) embedding model for conic convex optimization. In this norm two measures of the...
TREC
2003
15 years 18 days ago
2003
This year at TREC 2003 we participated in the robust track and investigated the use of very simple retrieval rules based on convex combinations of similarity measures based on fi...