Sciweavers

340 search results - page 59 / 68
» Efficient algorithms for bichromatic separability
Sort
View
ECML
2006
Springer
15 years 1 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
65
Voted
MICCAI
2000
Springer
15 years 1 months ago
Interactive Organ Segmentation Using Graph Cuts
Abstract. An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of nei...
Yuri Boykov, Marie-Pierre Jolly
71
Voted
AUSDM
2008
Springer
188views Data Mining» more  AUSDM 2008»
14 years 11 months ago
Priority Driven K-Anonymisation for Privacy Protection
Given the threat of re-identification in our growing digital society, guaranteeing privacy while providing worthwhile data for knowledge discovery has become a difficult problem. ...
Xiaoxun Sun, Hua Wang, Jiuyong Li
VMV
2008
187views Visualization» more  VMV 2008»
14 years 11 months ago
Patch-Graph Reconstruction for Piecewise Smooth Surfaces
In this paper we present a new surface reconstruction technique for piecewise smooth surfaces from point clouds, such as scans of architectural sites or man-made artifacts. The te...
Philipp Jenke, Michael Wand, Wolfgang Straße...
ISASSCI
2001
14 years 11 months ago
Data Mining Architectures - A Comparative Study
Data mining is the process of deriving knowledge from data. The architecture of a data mining system plays a significant role in the efficiency with which data is mined. It is pro...
Thomas Thomas, Sanjeev Jayakumar, B. Muthukumaran