Sciweavers

53 search results - page 9 / 11
» Optimal Partitions of Data In Higher Dimensions
Sort
View
ICDE
2009
IEEE
176views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Table Anonymization for Aggregate Query Answering
Abstract-- Privacy protection is a major concern when microdata needs to be released for ad hoc analyses. This has led to a lot of recent research in privacy goals and table anonym...
Cecilia M. Procopiuc, Divesh Srivastava
IMC
2004
ACM
14 years 27 days ago
Introducing scalability in network measurement: toward 10 Gbps with commodity hardware
The capacity of today's network links, along with the heterogeneity of their traffic, is rapidly growing, more than the workstation’s processing power. This makes the task ...
Loris Degioanni, Gianluca Varenni
MICCAI
2004
Springer
14 years 8 months ago
Implicit Active Shape Models for 3D Segmentation in MR Imaging
Extraction of structures of interest in medical images is often an arduous task because of noisy or incomplete data. However, handsegmented data are often available and most of the...
Mikaël Rousson, Nikos Paragios, Rachid Derich...
CGF
2008
126views more  CGF 2008»
13 years 7 months ago
Maximum Entropy Coordinates for Arbitrary Polytopes
Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle's vertices, and they provide a convenient way to lin...
K. Hormann, N. Sukumar
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 7 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis