Sciweavers

28888 search results - page 396 / 5778
» Computability and complexity in analysis
Sort
View
NECO
2010
97views more  NECO 2010»
15 years 5 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell
ICPR
2006
IEEE
16 years 8 months ago
DTM Generation from LIDAR Data using Skewness Balancing
LIght Detection And Ranging (LIDAR) data for terrain and land surveying has contributed to many environmental, engineering and civil applications. However, the analysis of Digital...
David C. Mason, Hong Wei, Marc Bartels
ICPR
2002
IEEE
16 years 8 months ago
Face Detection Using a Modified Radial Basis Function Neural Network
Face detection from cluttered images is very challenging due to the diverse variation of face appearance and the complexity of image background. In this paper, we propose a neural...
Lin-Lin Huang, Akinobu Shimizu, Hidefumi Kobatake
STACS
2009
Springer
16 years 1 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
CSE
2009
IEEE
16 years 1 months ago
Modelling of Pseudonymity under Probabilistic Linkability Attacks
—This paper contributes to the field of measuring (un)linkability in communication systems; a subproblem of privacy protection. We propose an attacker state model for attacks on...
Martin Neubauer