Sciweavers

3007 search results - page 241 / 602
» Linear Functional Fixed-points
Sort
View
ECCC
2010
89views more  ECCC 2010»
15 years 4 months ago
Lower bounds for designs in symmetric spaces
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
Noa Eidelstein, Alex Samorodnitsky
PAMI
2011
14 years 11 months ago
Kernel Optimization in Discriminant Analysis
— Kernel mapping is one of the most used approaches to intrinsically derive nonlinear classifiers. The idea is to use a kernel function which maps the original nonlinearly separ...
Di You, Onur C. Hamsici, Aleix M. Martínez
ICPR
2000
IEEE
16 years 5 months ago
The Response of Texture Features to Illuminant Rotation
Rotation of the illuminant source about a subject textured surface can cause catastrophic failure of texture classification schemes. This is due to the variation of texture featur...
Mike J. Chantler, Ged McGunnigle
CRYPTO
2009
Springer
131views Cryptology» more  CRYPTO 2009»
15 years 10 months ago
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
The well-studied task of learning a linear function with errors is a seemingly hard problem and the basis for several cryptographic schemes. Here we demonstrate additional applicat...
Benny Applebaum, David Cash, Chris Peikert, Amit S...
SEMWEB
2005
Springer
15 years 9 months ago
Modeling the Non-Expected Choice: A Weighted Utility Logit
This work derives and simulates two choice models applying the weighted utility theory, a generalization of the expected utility theory. It shows one set of assumptions, which jus...
Pia Koskenoja