We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...
hima and I. Fujishiro, "Measuring volumetric coherence," In ACM SIGGRAPH98 Conference Abstracts and Applications, p.260, July 1998. 1999 K.Garatani, H.Nakamura, H.Okuda a...
We introduce a Write-Once Read-Many (WORM) storage system providing strong assurances of data retention and compliant migration, by leveraging trusted secure hardware in close dat...
In this paper, we present a new record linkage approach that uses entity behavior to decide if potentially different entities are in fact the same. An entity’s behavior is extra...
Mohamed Yakout, Ahmed K. Elmagarmid, Hazem Elmelee...