—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...
Bag of features is a well established technique for the visual categorisation of objects, categories of objects and textures. One of the most important part of this technique is co...
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Abstract— Measurements have shown that network path failures occur frequently in the Internet and physical link failures can cause network instability in large scale and severity...
Current 2D face recognition systems encounter difficulties in recognizing faces with large pose variations. Utilizing the pose-invariant features of 3D face data has the potentia...