Sciweavers

5100 search results - page 587 / 1020
» The Linear Complexity of a Graph
Sort
View
ICPR
2006
IEEE
16 years 25 days ago
Class Separability in Spaces Reduced By Feature Selection
We investigated the geometrical complexity of several high-dimensional, small sample classification problems and its changes due to two popular feature selection procedures, forw...
Erinija Pranckeviciene, TinKam Ho, Ray L. Somorjai
183
Voted
COLT
2005
Springer
16 years 10 days ago
Analysis of Perceptron-Based Active Learning
We start by showing that in an active learning setting, the Perceptron algorithm needs Ω( 1 ε2 ) labels to learn linear separators within generalization error ε. We then prese...
Sanjoy Dasgupta, Adam Tauman Kalai, Claire Montele...
ECML
2005
Springer
16 years 10 days ago
Model Selection in Omnivariate Decision Trees
We propose an omnivariate decision tree architecture which contains univariate, multivariate linear or nonlinear nodes, matching the complexity of the node to the complexity of the...
Olcay Taner Yildiz, Ethem Alpaydin

Publication
464views
15 years 11 months ago
Fast image and video denoising via nonlocal means of similar neighborhoods
In this note, improvements to the non-local means image denoising method introduced in [2], [3] are presented. The original non-local means method replaces a noisy pixel by the ...
Mona Mahmoudi, Guillermo Sapiro
CRYPTO
1999
Springer
103views Cryptology» more  CRYPTO 1999»
15 years 11 months ago
Information Theoretically Secure Communication in the Limited Storage Space Model
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
Yonatan Aumann, Michael O. Rabin