Sciweavers

9209 search results - page 189 / 1842
» Data Space Randomization
Sort
View
KR
2010
Springer
15 years 10 months ago
Interpreting Topological Logics over Euclidean Spaces
Topological logics are a family of languages for representing and reasoning about topological data. In this paper, we consider propositional topological logics able to express the...
Roman Kontchakov, Ian Pratt-Hartmann, Michael Zakh...
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
16 years 6 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
MICCAI
2009
Springer
16 years 2 days ago
On the Manifold Structure of the Space of Brain Images
This paper investigates an approach to model the space of brain images through a low-dimensional manifold. A data driven method to learn a manifold from a collections of brain imag...
Samuel Gerber, Tolga Tasdizen, Sarang C. Joshi, Ro...
ICML
2008
IEEE
16 years 5 months ago
Random classification noise defeats all convex potential boosters
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
Philip M. Long, Rocco A. Servedio
ICDM
2006
IEEE
93views Data Mining» more  ICDM 2006»
15 years 11 months ago
Comparisons of K-Anonymization and Randomization Schemes under Linking Attacks
Recently K-anonymity has gained popularity as a privacy quantification against linking attacks, in which attackers try to identify a record with values of some identifying attrib...
Zhouxuan Teng, Wenliang Du