Sciweavers

150 search results - page 25 / 30
» Obtaining and Evaluating Generalized Association Rules
Sort
View
EDBT
2009
ACM
145views Database» more  EDBT 2009»
15 years 1 months ago
An efficient online auditing approach to limit private data disclosure
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
Haibing Lu, Yingjiu Li, Vijayalakshmi Atluri, Jaid...
60
Voted
WWW
2009
ACM
15 years 4 months ago
Network-aware forward caching
This paper proposes and evaluates a Network Aware Forward Caching approach for determining the optimal deployment strategy of forward caches to a network. A key advantage of this ...
Jeffrey Erman, Alexandre Gerber, Mohammad Taghi Ha...
WWW
2005
ACM
15 years 10 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
KDD
2008
ACM
217views Data Mining» more  KDD 2008»
15 years 10 months ago
Stream prediction using a generative model based on frequent episodes in event sequences
This paper presents a new algorithm for sequence prediction over long categorical event streams. The input to the algorithm is a set of target event types whose occurrences we wis...
Srivatsan Laxman, Vikram Tankasali, Ryen W. White
CP
2005
Springer
15 years 3 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville