Sciweavers

4171 search results - page 656 / 835
» Choice numbers of graphs
Sort
View
BROADNETS
2007
IEEE
16 years 26 days ago
Strategic deployment of network monitors for attack attribution
—Attacks launched over the Internet have become a pressing problem. Attackers make use of a variety of techniques to anonymize their traffic, in order to escape detection and pr...
Young June Pyun, Douglas S. Reeves
EDOC
2007
IEEE
16 years 26 days ago
Incorporating Security Behaviour into Business Models Using a Model Driven Approach
There has, in recent years, been growing interest in Model Driven Engineering (MDE), in which models are the primary design artifacts and transformations are applied to these mode...
Peter F. Linington, Pulitha Liyanagama
GLVLSI
2007
IEEE
187views VLSI» more  GLVLSI 2007»
16 years 26 days ago
DAG based library-free technology mapping
This paper proposes a library-free technology mapping algorithm to reduce delay in combinational circuits. The algorithm reduces the overall number of series transistors through t...
Felipe S. Marques, Leomar S. da Rosa Jr., Renato P...
ICC
2007
IEEE
139views Communications» more  ICC 2007»
16 years 25 days ago
Distributed Link Scheduling for TDMA Mesh Networks
— We present a distributed scheduling algorithm for provisioning of guaranteed link bandwidths in ad hoc mesh networks. The guaranteed link bandwidths are necessary to provide de...
Petar Djukic, Shahrokh Valaee
COCO
2007
Springer
96views Algorithms» more  COCO 2007»
16 years 21 days ago
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
Venkatesan Guruswami, Christopher Umans, Salil P. ...