Sciweavers

2570 search results - page 192 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
BMCBI
2010
218views more  BMCBI 2010»
15 years 4 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
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 5 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
BMCBI
2010
151views more  BMCBI 2010»
15 years 4 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
16 years 4 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
ICC
2009
IEEE
144views Communications» more  ICC 2009»
15 years 11 months ago
Analysis, Insights and Generalization of a Fast Decentralized Relay Selection Mechanism
Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays an...
Virag Shah, Neelesh B. Mehta, Raymond Yim