Sciweavers

170 search results - page 19 / 34
» On Metro-Line Crossing Minimization
Sort
View
IPL
2002
89views more  IPL 2002»
13 years 7 months ago
New bounds on the barycenter heuristic for bipartite graph drawing
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
Xiao Yu Li, Matthias F. M. Stallmann
ICNP
2007
IEEE
14 years 1 months ago
Design and Implementation of Cross-Domain Cooperative Firewall
Security and privacy are two major concerns in supporting roaming users across administrative domains. In current practices, a roaming user often uses encrypted tunnels, e.g., Virt...
Jerry Cheng, Hao Yang, Starsky H. Y. Wong, Petros ...
CIKM
2009
Springer
14 years 1 days ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...
NETWORK
2007
163views more  NETWORK 2007»
13 years 6 months ago
A Cross-Layering Design for IPv6 Fast Handover Support in an IEEE 802.16e Wireless MAN
Broadband wireless access networks, such as the IEEE 802.16 standard for wireless metropolitan area networks (WMANs), aim to provide high bandwidth, low-cost, scalable solutions t...
Youn-Hee Han, Heejin Jang, JinHyeock Choi, Byungjo...
WAOA
2004
Springer
91views Algorithms» more  WAOA 2004»
14 years 22 days ago
Pricing Network Edges to Cross a River
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
Alexander Grigoriev, Stan P. M. van Hoesel, Anton ...