1146 search results - page 118 / 230 » Finite cupping sets |
NIPS
2008
13 years 11 months ago
2008
This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similar existing bounds derived for the i.i.d. case. Our bounds ...
IJIT
2004
13 years 11 months ago
2004
Abstract-- We consider a hybrid knowledge representation system for ontological knowledge bases in order to maintain knowledge consistency between taxonomic knowledge and assertion...
NIPS
2001
13 years 11 months ago
2001
We describe latent Dirichlet allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a three-level hierarchical Bayesian m...
COLING
1992
13 years 11 months ago
1992
No one has come up with a completely satisfactory set of deep cases relations (or thematic relations). The underlying reason is that any finite set of case relations can capture o...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC (S) of S is define...