Sciweavers

2635 search results - page 218 / 527
» Algorithms for the Database Layout Problem
Sort
View
CIKM
2006
Springer
15 years 10 months ago
An integer programming approach for frequent itemset hiding
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
Aris Gkoulalas-Divanis, Vassilios S. Verykios
TCSV
2008
150views more  TCSV 2008»
15 years 6 months ago
Mining Recurring Events Through Forest Growing
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
Junsong Yuan, Jingjing Meng, Ying Wu, Jiebo Luo
SIGMOD
2010
ACM
204views Database» more  SIGMOD 2010»
15 years 4 months ago
Multi-dimensional keyword-based image annotation and search
Effective keyword search on image databases is a major open problem, due to the inherent imprecision of keywords (tags) used to describe images' content. In this paper we pre...
Ilaria Bartolini, Paolo Ciaccia
ICDE
2001
IEEE
143views Database» more  ICDE 2001»
16 years 8 months ago
Exactly-once Semantics in a Replicated Messaging System
A distributed message delivery system can use replication to improve performance and availability. However, without safeguards, replicated messages may be delivered to a mobile de...
Yongqiang Huang, Hector Garcia-Molina
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 6 months ago
Providing k-anonymity in data mining
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
Arik Friedman, Ran Wolff, Assaf Schuster