Sciweavers

587 search results - page 60 / 118
» On the Relative Sizes of Learnable Sets
Sort
View
PVLDB
2008
146views more  PVLDB 2008»
13 years 8 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...
CORR
2010
Springer
75views Education» more  CORR 2010»
13 years 7 months ago
Dense Error-Correcting Codes in the Lee Metric
Several new applications and a number of new mathematical techniques have increased the research on errorcorrecting codes in the Lee metric in the last decade. In this work we cons...
Tuvi Etzion, Alexander Vardy, Eitan Yaakobi
WWW
2010
ACM
14 years 3 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney
JEI
2000
134views more  JEI 2000»
13 years 8 months ago
Pattern matching using the blur hit - miss transform
The usefulness of the hit-miss transform (HMT) and related transforms for pattern matching in document image applications is examined. Although the HMT is sensitive to the types o...
Dan S. Bloomberg, Luc Vincent
IPPS
2003
IEEE
14 years 2 months ago
Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tas...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre...