Sciweavers

1419 search results - page 266 / 284
» Approximation Methods for Supervised Learning
Sort
View
SEMWEB
2010
Springer
13 years 3 months ago
A reasonable Semantic Web
Abstract. The realization of Semantic Web reasoning is central to substantiating the Semantic Web vision. However, current mainstream research on this topic faces serious challenge...
Pascal Hitzler, Frank van Harmelen
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 1 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
PAMI
2006
221views more  PAMI 2006»
13 years 8 months ago
Face Recognition from a Single Training Image under Arbitrary Unknown Lighting Using Spherical Harmonics
In this paper, we propose two novel methods for face recognition under arbitrary unknown lighting by using spherical harmonics illumination representation, which require only one t...
Lei Zhang 0002, Dimitris Samaras
JMLR
2006
124views more  JMLR 2006»
13 years 8 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
FOCS
2003
IEEE
14 years 2 months ago
Proving Hard-Core Predicates Using List Decoding
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
Adi Akavia, Shafi Goldwasser, Shmuel Safra