9209 search results - page 1540 / 1842 » Data Space Randomization |
156
Voted
PKDD
2010
Springer
15 years 2 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
159
click to vote
BMCBI
2010
15 years 2 months ago
2010
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
180
click to vote
WWW
2011
ACM
14 years 12 months ago
2011
ACM
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, ...
134
click to vote
PERCOM
2011
ACM
14 years 8 months ago
2011
ACM
Abstract—Online social networks such as Facebook, MySpace, and Orkut store large amounts of sensitive user data. While a user can legitimately assume that a social network provid...
154
click to vote
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
Today’s one-pass analytics applications tend to be data-intensive in nature and require the ability to process high volumes of data efficiently. MapReduce is a popular programm...