Sciweavers

54 search results - page 7 / 11
» Sublinear-Time Approximation for Clustering Via Random Sampl...
Sort
View
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 7 months ago
Sidelobe Control in Collaborative Beamforming via Node Selection
Collaborative beamforming (CB) is a power efficient method for data communications in wireless sensor networks (WSNs) which aims at increasing the transmission range in the network...
Mohammed F. A. Ahmed, Sergiy A. Vorobyov
ICALP
2005
Springer
14 years 1 months ago
Linear Time Algorithms for Clustering Problems in Any Dimensions
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
Amit Kumar, Yogish Sabharwal, Sandeep Sen
TALG
2010
158views more  TALG 2010»
13 years 2 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
ICCAD
2004
IEEE
145views Hardware» more  ICCAD 2004»
14 years 4 months ago
Asymptotic probability extraction for non-normal distributions of circuit performance
While process variations are becoming more significant with each new IC technology generation, they are often modeled via linear regression models so that the resulting performanc...
Xin Li, Jiayong Le, Padmini Gopalakrishnan, Lawren...
BMCBI
2008
117views more  BMCBI 2008»
13 years 7 months ago
New resampling method for evaluating stability of clusters
Background: Hierarchical clustering is a widely applied tool in the analysis of microarray gene expression data. The assessment of cluster stability is a major challenge in cluste...
Irina Gana Dresen, Tanja Boes, Johannes Hüsin...