Sciweavers

845 search results - page 56 / 169
» Complexity Dimensions and Learnability
Sort
View
97
Voted
TCC
2010
Springer
175views Cryptology» more  TCC 2010»
14 years 11 months ago
Obfuscation of Hyperplane Membership
Previous work on program obfuscation gives strong negative results for general-purpose obfuscators, and positive results for obfuscating simple functions such as equality testing (...
Ran Canetti, Guy N. Rothblum, Mayank Varia
94
Voted
FOCS
2010
IEEE
14 years 10 months ago
Learning Convex Concepts from Gaussian Distributions with PCA
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
Santosh Vempala
84
Voted
SMI
2007
IEEE
129views Image Analysis» more  SMI 2007»
15 years 7 months ago
Localized Homology
In this paper, we introduce localized homology, a theory for finding local geometric descriptions for topological attributes. Given a space and a cover of subspaces, we construct...
Afra Zomorodian, Gunnar Carlsson
129
Voted
CCECE
2006
IEEE
15 years 6 months ago
Group-Optimal Linear Space-Time Multiuser Detection
Multiuser detection (MUD) techniques are known to improve the performance of CDMA cellular communication systems. This performance improvement usually comes at a large computation...
Benoit Pelletier, Benoît Champagne
77
Voted
SEMWEB
2004
Springer
15 years 6 months ago
Querying Faceted Databases
Faceted classification allows one to model applications with complex classification hierarchies using orthogonal dimensions. Recent work has examined the use of faceted classi...
Kenneth A. Ross, Angel Janevski