Sciweavers

2180 search results - page 167 / 436
» Algorithms for discovering bucket orders from data
Sort
View
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
16 years 6 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
ICFCA
2009
Springer
16 years 1 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...
ICPR
2008
IEEE
16 years 27 days ago
Determination of optimal metabolic pathways through a new learning algorithm
In the present article, we introduce a new method for identification of metabolic pathways in constraint based models that consider enzyme and substrate concentrations. It genera...
C. A. Murthy, Mouli Das, Rajat K. De, Subhasis Muk...
ISBI
2006
IEEE
16 years 7 months ago
A fast and robust ODF estimation algorithm in Q-ball imaging
We propose a simple and straightforward analytic solution for the Q-ball reconstruction of the diffusion orientation distribution function (ODF) of the underlying fiber population...
Maxime Descoteaux, Elaine Angelino, Shaun Fitzgibb...
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 10 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte