2516 search results - page 33 / 504 » When is there a representer theorem |
162
click to vote
IJON
2006
15 years 6 months ago
2006
We present a framework for efficient extrapolation of reduced rank approximations, graph kernels, and locally linear embeddings (LLE) to unseen data. We also present a principled ...
133
click to vote
RSA
2010
15 years 4 months ago
2010
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...
202
click to vote
DLOG
2010
15 years 4 months ago
2010
Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-...
148
click to vote
DISOPT
2008
15 years 6 months ago
2008
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
206
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—In this paper we address the problem of scalable and load balanced routing for wireless sensor networks. Motivated by the analog of the continuous setting that geodesic routing ...