Sciweavers

9209 search results - page 98 / 1842
» Data Space Randomization
Sort
View
229
Voted
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
16 years 4 months ago
On Randomization, Public Information and the Curse of Dimensionality
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
Charu C. Aggarwal
DBISP2P
2004
Springer
150views Database» more  DBISP2P 2004»
15 years 8 months ago
Adapting the Content Native Space for Load Balanced Indexing
Today, there is an increasing demand to share data with complex data types (e.g., multi-dimensional) over large numbers of data sources. One of the key challenges is sharing these ...
Yanfeng Shu, Kian-Lee Tan, Aoying Zhou
131
Voted
WPES
2003
ACM
15 years 7 months ago
Analysis of privacy preserving random perturbation techniques: further explorations
Privacy is becoming an increasingly important issue in many data mining applications, particularly in the security and defense area. This has triggered the development of many pri...
Haimonti Dutta, Hillol Kargupta, Souptik Datta, Kr...
97
Voted
IBPRIA
2005
Springer
15 years 8 months ago
Fast Surface Grading Using Color Statistics in the CIE Lab Space
In this paper we approach the problem of fast surface grading of flat pieces decorated with random patterns. The proposed method is based on the use of global statistics of color ...
Fernando López, José Miguel Valiente...
112
Voted
EVOW
2003
Springer
15 years 7 months ago
Search Space Analysis of the Linear Ordering Problem
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
Tommaso Schiavinotto, Thomas Stützle