Sciweavers

165 search results - page 29 / 33
» Algorithms for Sparse Linear Classifiers in the Massive Data...
Sort
View
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 7 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
ACCV
2010
Springer
13 years 2 months ago
Randomised Manifold Forests for Principal Angle-Based Face Recognition
Abstract. In set-based face recognition, each set of face images is often represented as a linear/nonlinear manifold and the Principal Angles (PA) or Kernel PAs are exploited to me...
Ujwal D. Bonde, Tae-Kyun Kim, K. R. Ramakrishnan
JMLR
2006
156views more  JMLR 2006»
13 years 7 months ago
Large Scale Multiple Kernel Learning
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
Sören Sonnenburg, Gunnar Rätsch, Christi...
JEI
2002
88views more  JEI 2002»
13 years 7 months ago
Natural image database and its use for scene illuminant estimation
This paper describes a database collecting natural color images, called the Natural Image Database, and shows how it is used for illuminant estimation problems. First, we present ...
Shoji Tominaga
EON
2008
13 years 8 months ago
Abductive Synthesis of the Mediator Scenario with jABC and GEM
We reuse here the framework, the setting, and the semantic modelling for the automated synthesis of the SWS Challenge Mediator presented in the companion paper [5], and show how to...
Christian Kubczak, Tiziana Margaria, Matthias Kais...