Sciweavers

569 search results - page 94 / 114
» An efficient clustering method for k-anonymization
Sort
View
CGF
2008
200views more  CGF 2008»
13 years 8 months ago
Deep Opacity Maps
We present a new method for rapidly computing shadows from semi-transparent objects like hair. Our deep opacity maps method extends the concept of opacity shadow maps by using a d...
Cem Yuksel, John Keyser
ICCV
2009
IEEE
15 years 1 months ago
Saliency Driven Total Variation Segmentation
This paper introduces an unsupervised color segmentation method. The underlying idea is to segment the input image several times, each time focussing on a different salient part...
Michael Donoser, Martin Urschler, Martin Hirzer an...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 9 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 8 months ago
Settling the Polynomial Learnability of Mixtures of Gaussians
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We give an algorithm for this problem that has running ...
Ankur Moitra, Gregory Valiant
BMCBI
2005
143views more  BMCBI 2005»
13 years 8 months ago
Gene capture prediction and overlap estimation in EST sequencing from one or multiple libraries
Background: In expressed sequence tag (EST) sequencing, we are often interested in how many genes we can capture in an EST sample of a targeted size. This information provides ins...
Ji-Ping Z. Wang, Bruce G. Lindsay 0002, Liying Cui...