Sciweavers

CORR
2011
Springer
139views Education» more  CORR 2011»
13 years 3 months ago
Clustering Partially Observed Graphs via Convex Optimization
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
Ali Jalali, Yudong Chen, Sujay Sanghavi, Huan Xu
CATS
2006
14 years 25 days ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
ICPP
2009
IEEE
14 years 6 months ago
SkipStream: A Clustered Skip Graph Based On-demand Streaming Scheme over Ubiquitous Environments
Providing continuous on-demand streaming services with VCR functionality over ubiquitous environments is challenging due to the stringent QoS requirements of streaming service as ...
Qifeng Yu, Tianyin Xu, Baoliu Ye, Sanglu Lu, Daoxu...