Sciweavers

148 search results - page 12 / 30
» Fast Data Anonymization with Low Information Loss
Sort
View
DASFAA
2006
IEEE
109views Database» more  DASFAA 2006»
14 years 1 months ago
Assessing the Completeness of Sensor Data
In this paper we present a quality model highlighting the completeness of sensor data with respect to its application. The model allows consistent handling of information loss as d...
Jit Biswas, Felix Naumann, Qiang Qiu
SIGMOD
2012
ACM
246views Database» more  SIGMOD 2012»
11 years 10 months ago
Skimmer: rapid scrolling of relational query results
A relational database often yields a large set of tuples as the result of a query. Users browse this result set to find the information they require. If the result set is large, ...
Manish Singh, Arnab Nandi, H. V. Jagadish
IFIP
2009
Springer
14 years 6 days ago
Secure Information Flow for Distributed Systems
We present an abstract language for distributed systems of processes with local memory and private communication channels. Communication between processes is done via messaging. Th...
Rafael Alpízar, Geoffrey Smith
INFOCOM
2009
IEEE
14 years 2 months ago
Time Valid One-Time Signature for Time-Critical Multicast Data Authentication
Abstract—It is challenging to provide authentication to timecritical multicast data, where low end-to-end delay is of crucial importance. Consequently, it requires not only effi...
Qiyan Wang, Himanshu Khurana, Ying Huang, Klara Na...
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 9 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand