Searching for "Minimum Path Bases." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

7 documents found, showing 1 through 7.

A Note on Minimum Path Bases
by Petra M. Gleiss, Josef Leydold, Peter F. Stadler
…A Note On Minimum Path Bases Petra M. Gleiss a , Josef Leydold b , Peter F. Stadler a,c a…
Add To MetaCart

M.: Novel path search algorithm for image stitching and advanced texture tiling
by Petr Somol, Michal Haindl — 2005 — In: Proceedings of 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision
… in many other applications (see, e.g., [Efr01]). Adaptive Boundary Blending The minimum path based…
Cited by 2 (0 self) – Add To MetaCart

Single Shortest Path-based Logical Topologies for Grooming IP Traffic over Wavelength
by Gaurav Agrawal, Deep Medhi — 2005 — of 2nd IEEE/Create-Net International Workshop on Traffic Grooming (colocated with Broadnets2005
… paper. minimum-path based topologies exist for a given number of nodes and a particular virtual topology…
Cited by 1 (0 self) – Add To MetaCart

Investigation of Route Guidance Generation Issues by Simulation with DynaMIT
by J. Bottom, J. Bottom, M. Ben-akiva, M. Ben-akiva, M. Bierlaire, M. Bierlaire, I. Chabini, I. Chabini, H. Koutsopoulos, H. Koutsopoulos, Q. Yang, Q. Yang — 1999 — Proceedings of the 14th International Symposium on Transportation and Traffic Theory
… minimum paths based on free-flow travel times, while guided vehicles are assumed to comply fully with time…
Cited by 9 (3 self) – Add To MetaCart

c○Springer-Verlag Data Resampling for Path Based Clustering
by Bernd Fischer, Joachim M. Buhmann
… low running time, but we can not guarantee that the global minimum of the Path Based Clustering cost…
Add To MetaCart

2007b. Comparing Wikipedia and German Wordnet by Evaluating Semantic Relatedness on Multiple Datasets
by Torsten Zesch, Iryna Gurevych, Max Mühlhäuser — In Proc. of NAACL-HLT
… value among all pairs (ck, cl), i.e., the minimum for path based, and the maximum for information…
Cited by 3 (3 self) – Add To MetaCart

c○2007 The Association for Computational Linguistics Order copies of this and other ACL proceedings from:
by unknown authors — 2007
…. There can be more than one path between two nodes. The shortest path length L is the minimum of all…
Add To MetaCart

Showing 1 through 7.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB