Sciweavers

1963 search results - page 239 / 393
» The Maximum Solution Problem on Graphs
Sort
View
INFOCOM
1998
IEEE
15 years 5 months ago
Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
Rajesh M. Krishnaswamy, Kumar N. Sivarajan
200
Voted
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
16 years 27 days ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...
109
Voted
SIGCOMM
1998
ACM
15 years 5 months ago
Secure Group Communications Using Key Graphs
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
Chung Kei Wong, Mohamed G. Gouda, Simon S. Lam
ICPPW
2002
IEEE
15 years 5 months ago
Finding Multiple Routing Paths in Wide-Area WDM Networks
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
Weifa Liang, Xiaojun Shen
105
Voted
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 7 months ago
Power Allocation Based on SEP Minimization in Two-Hop Decode-and-Forward Relay Networks
—The problem of optimal power allocation among the relays in a two-hop decode-and-forward cooperative relay network with independent Rayleigh fading channels is considered. It is...
Arash Khabbazibasmenj, Sergiy A. Vorobyov