Sciweavers

727 search results - page 84 / 146
» One line and n points
Sort
View
85
Voted
CORR
2008
Springer
138views Education» more  CORR 2008»
14 years 10 months ago
An Improved Robust Fuzzy Extractor
We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W, W to agree on a secret key R in the presence of an active ...
Bhavana Kanukurthi, Leonid Reyzin
KES
2007
Springer
15 years 4 months ago
Online Training of Hierarchical RBF
Efficient multi-scale manifold reconstruction from point clouds can be obtained through the Hierarchical Radial Basis Functions (HRBF) network. An online training procedure for HRB...
Francesco Bellocchio, Stefano Ferrari, Vincenzo Pi...
ALT
1998
Springer
15 years 2 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
CCCG
2006
14 years 11 months ago
K-Nearest Neighbor Search using the Pyramid Technique
A k-nearest neighbor search algorithm for the Pyramid technique is presented. The Pyramid technique divides d-dimensional data space into 2d pyramids. Given a query point q, we in...
Bradford G. Nickerson, Qingxiu Shi
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
15 years 3 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler