Sciweavers

627 search results - page 82 / 126
» Efficient Top-k Query Evaluation on Probabilistic Data
Sort
View
PODS
2008
ACM
174views Database» more  PODS 2008»
16 years 6 months ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
16 years 6 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
UAI
2008
15 years 7 months ago
Learning Inclusion-Optimal Chordal Graphs
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
Vincent Auvray, Louis Wehenkel
SIGMOD
2007
ACM
112views Database» more  SIGMOD 2007»
16 years 6 months ago
A random walk approach to sampling hidden databases
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden backend database to provide answers to user queries. ...
Arjun Dasgupta, Gautam Das, Heikki Mannila
MOBICOM
2000
ACM
15 years 10 months ago
A scalable low-latency cache invalidation strategy for mobile environments
—Caching frequently accessed data items on the client side is an effective technique for improving performance in a mobile environment. Classical cache invalidation strategies ar...
Guohong Cao