Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
Abstract. We consider the problem of camera selfcalibration, from images of a planar object with unknown Euclidean structure. The general case of possibly varying focal length is a...
Geometric deformable models based on the level set method have become very popular in the last several years. To overcome an inherent limitation in accuracy while maintaining comp...