Sciweavers

308 search results - page 24 / 62
» How Fast Is the k-Means Method
Sort
View
118
Voted
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 3 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
151
Voted
CIKM
2005
Springer
15 years 9 months ago
Opportunity map: a visualization framework for fast identification of actionable knowledge
Data mining techniques frequently find a large number of patterns or rules, which make it very difficult for a human analyst to interpret the results and to find the truly interes...
Kaidi Zhao, Bing Liu, Thomas M. Tirpak, Weimin Xia...
143
Voted
BMCBI
2010
218views more  BMCBI 2010»
15 years 3 months ago
Fast multi-core based multimodal registration of 2D cross-sections and 3D datasets
Background: Solving bioinformatics tasks often requires extensive computational power. Recent trends in processor architecture combine multiple cores into a single chip to improve...
Michael Scharfe, Rainer Pielot, Falk Schreiber
142
Voted
ENTCS
2006
118views more  ENTCS 2006»
15 years 3 months ago
Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
Abbas Edalat, Dirk Pattinson
127
Voted
NECO
2000
113views more  NECO 2000»
15 years 3 months ago
Geometric Analysis of Population Rhythms in Synaptically Coupled Neuronal Networks
We develop geometric dynamical systems methods to determine how various components contribute to a neuronal network's emergent population behavior. The results clarify the mu...
Jonathan E. Rubin, David Terman