Sciweavers

118 search results - page 13 / 24
» Fast Algorithms for Constant Approximation k-Means Clusterin...
Sort
View
86
Voted
BMCBI
2008
138views more  BMCBI 2008»
14 years 9 months ago
CASCADE: a novel quasi all paths-based network analysis algorithm for clustering biological interactions
Background: Quantitative characterization of the topological characteristics of protein-protein interaction (PPI) networks can enable the elucidation of biological functional modu...
Woochang Hwang, Young-Rae Cho, Aidong Zhang, Mural...
DICTA
2003
14 years 11 months ago
Fast Adaptive Algorithm for Time-Critical Color Quantization Application
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
Kiattisin Kanjanawanishkul, Bunyarit Uyyanonvara
81
Voted
GLOBECOM
2009
IEEE
15 years 4 months ago
Semi-Blind Gradient-Newton CMA and SDD Algorithm for MIMO Space-Time Equalisation
— Semi-blind space-time equalisation is considered for dispersive multiple-input multiple-output systems that employ high-throughput quadrature amplitude modulation signalling. A...
S. Chen, Lajos Hanzo, H.-T. Cheng
72
Voted
ARCS
2006
Springer
15 years 1 months ago
Power-Aware Collective Tree Exploration
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
Miroslaw Dynia, Miroslaw Korzeniowski, Christian S...
MOBIHOC
2008
ACM
15 years 9 months ago
Fast and quality-guaranteed data streaming in resource-constrained sensor networks
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
Emad Soroush, Kui Wu, Jian Pei