Sciweavers

3265 search results - page 266 / 653
» Representing Groups on Graphs
Sort
View
MASCOTS
2007
15 years 8 months ago
A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks
— We propose a hierarchical Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is an extension of our previous Connec...
Deniz Cokuslu, Kayhan Erciyes
CEC
2010
IEEE
15 years 7 months ago
A novel framework to elucidate core classes in a dataset
In this paper we present an original framework to extract representative groups from a dataset, and we validate it over a novel case study. The framework specifies the application ...
Daniele Soria, Jonathan M. Garibaldi
IJBRA
2008
63views more  IJBRA 2008»
15 years 6 months ago
Protein cavity clustering based on community structure of pocket similarity network
: Functions of a protein are mainly determined by its structure. Surface cavities, also called pockets or clefts, are ordinarily regarded as potentially active sites where the prot...
Zhi-Ping Liu, Ling-Yun Wu, Yong Wang, Xiang-Sun Zh...
153
Voted
COMCOM
2004
85views more  COMCOM 2004»
15 years 6 months ago
Optimal PNNI complex node representations for restrictive costs
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...
Ilias Iliadis
SBP
2011
Springer
15 years 1 months ago
Using Web-Based Knowledge Extraction Techniques to Support Cultural Modeling
The World Wide Web is a potentially valuable source of information about the cognitive characteristics of cultural groups. However, attempts to use the Web in the context of cultur...
Paul R. Smart, Winston R. Sieck, Nigel R. Shadbolt