Sciweavers

6142 search results - page 338 / 1229
» The Complexity of Partition Functions
Sort
View
SDM
2003
SIAM
125views Data Mining» more  SDM 2003»
15 years 8 months ago
Scalable, Balanced Model-based Clustering
This paper presents a general framework for adapting any generative (model-based) clustering algorithm to provide balanced solutions, i.e., clusters of comparable sizes. Partition...
Shi Zhong, Joydeep Ghosh
WSC
1998
15 years 8 months ago
Interference Radius in PCS Radio Resource Management Simulations
Simulation is widely used for performance analysis of Personal Communication Systems due to their inherent complexity. However, resource demands (cpu-time and memory requirements)...
Michael Liljenstam, Rassul Ayani
GLOBECOM
2008
IEEE
15 years 7 months ago
A Framework for Dual-Agent MANET Routing Protocols
— Nodes forming mobile ad hoc networks (MANET) nodes can be logically partitioned into 1) a selfish user agent serving the interests of the end user (owner) of the mobile device...
Brian L. Gaines, Mahalingam Ramkumar
IPL
2002
118views more  IPL 2002»
15 years 6 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
PR
2006
127views more  PR 2006»
15 years 6 months ago
Unsupervised possibilistic clustering
In fuzzy clustering, the fuzzy c-means (FCM) clustering algorithm is the best known and used method. Since the FCM memberships do not always explain the degrees of belonging for t...
Miin-Shen Yang, Kuo-Lung Wu