Sciweavers

4171 search results - page 596 / 835
» Choice numbers of graphs
Sort
View
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
16 years 1 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
ACSAC
2008
IEEE
16 years 1 months ago
The Role Hierarchy Mining Problem: Discovery of Optimal Role Hierarchies
Role hierarchies are fundamental to the role based access control (RBAC) model. The notion of role hierarchy is a well understood concept that allows senior roles to inherit the p...
Qi Guo, Jaideep Vaidya, Vijayalakshmi Atluri
ICDCS
2007
IEEE
16 years 28 days ago
Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks
In unstructured peer-to-peer (P2P) networks, the overlay topology (or connectivity graph) among peers is a crucial component in addition to the peer/data organization and search. ...
Hasan Guclu, Murat Yuksel
INFOCOM
2007
IEEE
16 years 28 days ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
BROADNETS
2006
IEEE
16 years 21 days ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...