We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
Abstract. Scene categorization is an important mechanism for providing high-level context which can guide methods for a more detailed analysis of scenes. State-of-the-art technique...
The security threat posed by malware in mobile wireless networks can be countered through immunization using security patches. The distribution of patches however consumes bandwidt...
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...