Sciweavers

1172 search results - page 121 / 235
» Path Algorithms on Regular Graphs
Sort
View
119
Voted
JAL
2006
175views more  JAL 2006»
15 years 17 days ago
Approximations for minimum and min-max vehicle routing problems
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
Esther M. Arkin, Refael Hassin, Asaf Levin
IJRR
2002
126views more  IJRR 2002»
15 years 8 days ago
Sensor-based Coverage of Unknown Environments
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
Ercan U. Acar, Howie Choset
INFOCOM
2002
IEEE
15 years 5 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...
MM
2009
ACM
269views Multimedia» more  MM 2009»
15 years 7 months ago
Semi-supervised topic modeling for image annotation
We propose a novel technique for semi-supervised image annotation which introduces a harmonic regularizer based on the graph Laplacian of the data into the probabilistic semantic ...
Yuanlong Shao, Yuan Zhou, Xiaofei He, Deng Cai, Hu...
93
Voted
BROADNETS
2006
IEEE
15 years 6 months ago
Traffic Grooming Techniques in Optical Networks
: With the increase of the number of wavelengths per fiber waveband switching has been proposed to decrease the number of switching ports in optical nodes. Another concept that of ...
Yabin Ye, Hagen Woesner, Imrich Chlamtac