Sciweavers

3204 search results - page 322 / 641
» The b-chromatic Number of a Graph
Sort
View
MOBICOM
2004
ACM
16 years 6 days ago
Analyzing the spread of active worms over VANET
Interactive communications among nodes in Vehicular Ad Hoc Networks (VANET) and the safety-oriented nature of many VANET applications necessitate a robust security framework. An a...
Syed A. Khayam, Hayder Radha
WADS
1993
Springer
110views Algorithms» more  WADS 1993»
15 years 11 months ago
A Dynamic Separator Algorithm
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
Deganit Armon, John H. Reif
CDC
2009
IEEE
155views Control Systems» more  CDC 2009»
15 years 10 months ago
Efficient and robust communication topologies for distributed decision making in networked systems
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
John S. Baras, Pedram Hovareshti
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
13 years 9 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
PAMI
2010
396views more  PAMI 2010»
15 years 5 months ago
Self-Validated Labeling of Markov Random Fields for Image Segmentation
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
Wei Feng, Jiaya Jia, Zhi-Qiang Liu