Sciweavers

522 search results - page 41 / 105
» A Graph Theoretical Approach to Network Encoding Complexity
Sort
View
MOBIHOC
2002
ACM
16 years 2 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
ICCV
2007
IEEE
16 years 5 months ago
Untangling Cycles for Contour Grouping
We introduce a novel topological formulation for contour grouping. Our grouping criterion, called untangling cycles, exploits the inherent topological 1D structure of salient cont...
Qihui Zhu, Gang Song, Jianbo Shi
INFFUS
2010
143views more  INFFUS 2010»
15 years 1 months ago
A multi-agent systems approach to distributed bayesian information fusion
This paper introduces design principles for modular Bayesian fusion systems which can (i) cope with large quantities of heterogeneous information and (ii) can adapt to changing co...
Gregor Pavlin, Patrick de Oude, Marinus Maris, Jan...
ICIP
2008
IEEE
15 years 9 months ago
Image representation by compressed sensing
This paper addresses the image representation problem in visual sensor networks. We propose a new image representation scheme based on compressive sensing (CS) because compressive...
Bing Han, Feng Wu, Dapeng Wu
DEDS
2002
106views more  DEDS 2002»
15 years 2 months ago
Efficient Computation and Representation of Large Reachability Sets for Composed Automata
We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized com...
Peter Buchholz, Peter Kemper