Sciweavers

232 search results - page 24 / 47
» Dynamic Graph Clustering Using Minimum-Cut Trees
Sort
View
ICDM
2007
IEEE
159views Data Mining» more  ICDM 2007»
15 years 10 months ago
Incremental Subspace Clustering over Multiple Data Streams
Data streams are often locally correlated, with a subset of streams exhibiting coherent patterns over a subset of time points. Subspace clustering can discover clusters of objects...
Qi Zhang, Jinze Liu, Wei Wang 0010
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
15 years 11 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
BMCBI
2006
127views more  BMCBI 2006»
15 years 4 months ago
Construction of phylogenetic trees by kernel-based comparative analysis of metabolic networks
Background: To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to c...
Sok June Oh, Je-Gun Joung, Jeong Ho Chang, Byoung-...
KES
2004
Springer
15 years 9 months ago
Content-Based Image Retrieval Using Multiple Representations
Many different approaches for content-based image retrieval have been proposed in the literature. Successful approaches consider not only simple features like color, but also take ...
Karin Kailing, Hans-Peter Kriegel, Stefan Schö...
GLOBECOM
2008
IEEE
15 years 11 months ago
Network Formation Games for Distributed Uplink Tree Construction in IEEE 802.16J Networks
— This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16j network’s relay stations (RSs) and their serving base station (MR-BS)....
Walid Saad, Zhu Han, Mérouane Debbah, Are H...