—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
LP can be seen as a logic of knowledge with justifications. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikk...
Abstract. This paper presents a Road Detection and Classification algorithm for Driver Assistance Systems (DAS), which tracks several road lanes and identifies the type of lane bou...
Juan Manuel Collado, Cristina Hilario, Arturo de l...
Background: In this paper, it is proposed an optimization approach for producing reduced alphabets for peptide classification, using a Genetic Algorithm. The classification task i...
We propose an image hashing algorithm that is based on distributed compression principles. The algorithm assumes the availability of a robust feature vector extracted from the ima...