Sciweavers

1387 search results - page 56 / 278
» Convexity in Discrete Space
Sort
View
APAL
2006
85views more  APAL 2006»
13 years 10 months ago
Compact spaces, elementary submodels, and the countable chain condition
Given a space X, J in an elementary submodel M of H(), define XM to be X M with the topology generated by {U M : U J M}. It is established, using anti-large-cardinals assumptio...
Lúcia R. Junqueira, Paul Larson, Franklin D...
IDEAL
2000
Springer
14 years 1 months ago
Clustering by Similarity in an Auxiliary Space
Abstract. We present a clustering method for continuous data. It defines local clusters into the (primary) data space but derives its similarity measure from the posterior distribu...
Janne Sinkkonen, Samuel Kaski
COMGEO
2002
ACM
13 years 9 months ago
Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited
The goals of this paper are twofold. The first is to present a new sampling theory for curves, based on a new notion of local feature size. The properties of this new feature size...
Daniel Freedman
JMLR
2012
12 years 13 days ago
Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
Garvesh Raskutti, Martin J. Wainwright, Bin Yu
NIPS
2001
13 years 11 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio