522 search results - page 65 / 105 » A Graph Theoretical Approach to Network Encoding Complexity |
118
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
172
Voted
CVIU
2011
14 years 6 months ago
2011
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
131
click to vote
COCO
2010
Springer
15 years 6 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
132
click to vote
CISS
2008
IEEE
15 years 9 months ago
2008
IEEE
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
140
click to vote
MOBIHOC
2008
ACM
16 years 2 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...