Sciweavers

2925 search results - page 222 / 585
» Information Complexity of Online Problems
Sort
View
CIKM
1998
Springer
15 years 10 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
CONEXT
2009
ACM
15 years 7 months ago
StarClique: guaranteeing user privacy in social networks against intersection attacks
Building on the popularity of online social networks (OSNs) such as Facebook, social content-sharing applications allow users to form communities around shared interests. Millions...
Krishna P. N. Puttaswamy, Alessandra Sala, Ben Y. ...
SIAMCOMP
2000
161views more  SIAMCOMP 2000»
15 years 6 months ago
Application-Controlled Paging for a Shared Cache
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...
Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vi...
WWW
2008
ACM
16 years 7 months ago
Tag-based social interest discovery
The success and popularity of social network systems, such as del.icio.us, Facebook, MySpace, and YouTube, have generated many interesting and challenging problems to the research...
Xin Li, Lei Guo, Yihong Eric Zhao
PODS
2012
ACM
297views Database» more  PODS 2012»
13 years 9 months ago
Query-based data pricing
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
Paraschos Koutris, Prasang Upadhyaya, Magdalena Ba...