Sciweavers

256 search results - page 3 / 52
» Short trees in polygons
Sort
View
CCCG
2007
13 years 7 months ago
Generalized Watchman Route Problem with Discrete View Cost
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta
ASPDAC
2008
ACM
80views Hardware» more  ASPDAC 2008»
13 years 8 months ago
An innovative Steiner tree based approach for polygon partitioning
Yongqiang Lu, Qing Su, Jamil Kawa
ORL
2008
77views more  ORL 2008»
13 years 6 months ago
A short proof of the VPN Tree Routing Conjecture on ring networks
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all ter...
Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo...
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
14 years 26 days ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu