Sciweavers

4009 search results - page 294 / 802
» Clustering on Complex Graphs
Sort
View
RSA
2000
112views more  RSA 2000»
15 years 6 months ago
Growth of components in random graphs
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
Svante Janson
GLOBECOM
2009
IEEE
16 years 1 months ago
A Decentralized Framework for Dynamic Downlink Base Station Cooperation
— Multiple Base Station (Multi-BS) cooperation has been considered as a promising mechanism to suppress cochannel interference and boost the capacity for cellular networks. Howev...
Sheng Zhou, Jie Gong, Zhisheng Niu, Yunjian Jia, P...
PDPTA
2004
15 years 8 months ago
J2EE Applications DEployment: A First Experiment
A J2EE application server is composed of multi-tiers: a web frontend, a servlet server, optionally an EJB server and a database. Clusters allow the replication of each tier instan...
Noel De Palma, Sébastien Jean, Slim Ben Ata...
SIGIR
2002
ACM
15 years 6 months ago
Unsupervised document classification using sequential information maximization
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
Noam Slonim, Nir Friedman, Naftali Tishby
COGSCI
2010
65views more  COGSCI 2010»
15 years 5 months ago
Network Structure Influences Speech Production
Network science provides a new way to look at old questions in cognitive science by examining the structure of a complex system, and how that structure might influence processing....
Kit Ying Chan, Michael S. Vitevitch