Sciweavers

11214 search results - page 20 / 2243
» Just-in-time data structures
Sort
View
PVLDB
2008
146views more  PVLDB 2008»
13 years 9 months ago
Resisting structural re-identification in anonymized social networks
We identify privacy risks associated with releasing network data sets and provide an algorithm that mitigates those risks. A network consists of entities connected by links repres...
Michael Hay, Gerome Miklau, David Jensen, Donald F...
PKDD
2010
Springer
155views Data Mining» more  PKDD 2010»
13 years 8 months ago
Latent Structure Pattern Mining
Pattern mining methods for graph data have largely been restricted to ground features, such as frequent or correlated subgraphs. Kazius et al. have demonstrated the use of elaborat...
Andreas Maunz, Christoph Helma, Tobias Cramer, Ste...
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 4 months ago
Psi-calculi: a framework for mobile processes with nominal data and logic
The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processe...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...
COMPGEOM
2005
ACM
13 years 11 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
DATESO
2006
102views Database» more  DATESO 2006»
13 years 11 months ago
Transforming Data from DataPile Structure into RDF
Huge amount of interesting data has been gathered in the DataPile structure since its creation. This data could be used in the development of RDF databases. When limited to basic i...
Jirí Dokulil