Sciweavers

728 search results - page 40 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
APVIS
2008
13 years 10 months ago
Interactive Visual Analysis of the NSF Funding Information
This paper presents an interactive visualization toolkit for navigating and analyzing the National Science Foundation (NSF) funding information. Our design builds upon the treemap...
Shixia Liu, Nan Cao, Hao Lv
FC
2005
Springer
142views Cryptology» more  FC 2005»
14 years 2 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
14 years 9 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
GRC
2008
IEEE
13 years 10 months ago
Towards Real-time Performance of Data Value Hiding for Frequent Data Updates
Hiding data values in privacy-preserving data mining (PPDM) protects information against unauthorized attacks while maintaining analytical data properties. The most popular models...
Jie Wang, Justin Zhan, Jun Zhang
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
14 years 10 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...