Sciweavers

17760 search results - page 44 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
123
Voted
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
16 years 16 days ago
GAD: General Activity Detection for Fast Clustering on Large Data.
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
Jiawei Han, Liangliang Cao, Sangkyum Kim, Xin Jin,...
122
Voted
KDD
1999
ACM
152views Data Mining» more  KDD 1999»
15 years 7 months ago
Applying General Bayesian Techniques to Improve TAN Induction
Tree Augmented Naive Bayes (TAN) has shown to be competitive with state-of-the-art machine learning algorithms [3]. However, the TAN induction algorithm that appears in [3] can be...
Jesús Cerquides
117
Voted
ICCVW
1999
Springer
15 years 7 months ago
Generalized Voxel Coloring
Image-based reconstruction from randomly scattered views is a challenging problem. We present a new algorithm that extends Seitz and Dyer’s Voxel Coloring algorithm. Unlike their...
W. Bruce Culbertson, Thomas Malzbender, Gregory G....
120
Voted
ISBI
2008
IEEE
16 years 4 months ago
3D general lesion segmentation in CT
This paper describes a general purpose algorithm to segment any kind of lesions in CT images. The algorithm expects a click or a stroke inside the lesion from the user and learns ...
Marie-Pierre Jolly, Leo Grady
126
Voted
JUCS
2010
133views more  JUCS 2010»
14 years 10 months ago
From Computing Sets of Optima, Pareto Sets, and Sets of Nash Equilibria to General Decision-Related Set Computations
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
Vladik Kreinovich, Bartlomiej Jacek Kubica