Sciweavers

198 search results - page 16 / 40
» A practical algorithm for constructing oblivious routing sch...
Sort
View
MST
2010
106views more  MST 2010»
14 years 10 months ago
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
Bruno Courcelle, Andrew Twigg
IJISEC
2010
114views more  IJISEC 2010»
14 years 9 months ago
A new hardware-assisted PIR with O(n) shuffle cost
Abstract Since the concept of private information retrieval (PIR) was first formalized by Chor et. al, various constructions have been proposed with a common goal of reducing commu...
Xuhua Ding, Yanjiang Yang, Robert H. Deng, Shuhong...
LR
2011
170views more  LR 2011»
14 years 6 months ago
Routing automated guided vehicles in container terminals through the Q-learning technique
This paper suggests a routing method for automated guided vehicles in port terminals that uses the Q-learning technique. One of the most important issues for the efficient operati...
Su Min Jeon, Kap Hwan Kim, Herbert Kopfer
ISPAN
2005
IEEE
15 years 5 months ago
Coordinated Robust Routing by Dual Cluster Heads in Layered Wireless Sensor Networks
In this paper, we propose the coordinated robust routing (CRR) scheme to address the fault tolerance requirements in the layered wireless sensor networks. In the proposed scheme, ...
Mei Yang, Jianping Wang, Zhen-guo Gao, Yingtao Jia...
MVA
1992
15 years 25 days ago
A New Parallel Scheme for Robust Segmentation of Textured Images
This paper proposes a parallel schemelalgorithm which is based on statistical analyses to fulfilthe robust segmentation of nature texture image. The whole scheme is constructed as...
Xudong Guan, Jian-qin Liu, Nanning Zheng