Sciweavers

221 search results - page 20 / 45
» Computing arbitrary functions of encrypted data
Sort
View
ICDM
2008
IEEE
185views Data Mining» more  ICDM 2008»
14 years 2 months ago
Clustering Uncertain Data Using Voronoi Diagrams
We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises t...
Ben Kao, Sau Dan Lee, David W. Cheung, Wai-Shing H...
TKDE
2010
251views more  TKDE 2010»
13 years 6 months ago
Clustering Uncertain Data Using Voronoi Diagrams and R-Tree Index
—We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises...
Ben Kao, Sau Dan Lee, Foris K. F. Lee, David Wai-L...
PG
2007
IEEE
14 years 1 months ago
Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
Oskar Åkerlund, Mattias Unger, Rui Wang
BMCBI
2004
143views more  BMCBI 2004»
13 years 7 months ago
Comparing functional annotation analyses with Catmap
Background: Ranked gene lists from microarray experiments are usually analysed by assigning significance to predefined gene categories, e.g., based on functional annotations. Tool...
Thomas Breslin, Patrik Edén, Morten Krogh
ISVC
2005
Springer
14 years 1 months ago
Image Smoothing and Segmentation by Graph Regularization
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which leads to a family of nonlinear filters, such as the bilateral filter or the TV digi...
Sébastien Bougleux, Abderrahim Elmoataz