Sciweavers

2272 search results - page 162 / 455
» Provable Data Privacy
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
14 years 5 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...
IACR
2011
120views more  IACR 2011»
12 years 10 months ago
McOE: A Foolproof On-Line Authenticated Encryption Scheme
On-Line Authenticated Encryption (OAE) combines confidentiality with data integrity and is on-line computable. Most block cipher-based schemes for Authenticated Encryption can be ...
Ewan Fleischmann, Christian Forler, Stefan Lucks
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 11 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
AAIM
2009
Springer
118views Algorithms» more  AAIM 2009»
14 years 5 months ago
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier...