Sciweavers

1508 search results - page 19 / 302
» Efficient Path Profiling
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 8 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
14 years 1 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
ICAI
2008
13 years 11 months ago
Computationally Efficient Path-Following using Adaptive Color Models
The ability to follow man-made paths and roads is an important capability for a number of robotic tasks. To operate in outdoor environments designed for humans, autonomous robots m...
Stuart Glaser, Eitan Marder-Eppstein, William Smar...
CONPAR
1992
14 years 1 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
CN
2008
76views more  CN 2008»
13 years 10 months ago
Efficient path protection in bi-directional WDM systems
Bi-directional WDM transmission is a technique that allows data to be transmitted simultaneously in both directions of a fiber, with different sets of wavelength channels for each...
Ji Li, Kwan L. Yeung, Chun-Kit Chan