Sciweavers

570 search results - page 70 / 114
» Edge Coloring with Delays
Sort
View
CN
2008
109views more  CN 2008»
14 years 12 months ago
CoCONet: A collision-free container-based core optical network
Electrical-to-optical domain conversions and vice versa (denoted by O/E/O conversions) for each hop in optical core transport networks impose considerable capital and financial ov...
Amin R. Mazloom, Preetam Ghosh, Kalyan Basu, Sajal...
SWAT
2004
Springer
163views Algorithms» more  SWAT 2004»
15 years 5 months ago
New Algorithms for Enumerating All Maximal Cliques
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
Kazuhisa Makino, Takeaki Uno
ICC
2008
IEEE
135views Communications» more  ICC 2008»
15 years 6 months ago
Using Soft-Line Recursive Response to Improve Query Aggregation in Wireless Sensor Networks
— In large Wireless Sensor Networks (WSNs), each hop might incur varying delays due to medium access contention, transmission and computation delays. Fast and efficient query re...
Xiaoming Lu, Matt Spear, Karl N. Levitt, Norman S....
INFOCOM
2000
IEEE
15 years 4 months ago
Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State
Abstract—Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechan...
Zhiruo Cao, Zheng Wang, Ellen W. Zegura
ICCAD
2004
IEEE
87views Hardware» more  ICCAD 2004»
15 years 8 months ago
Exploiting level sensitive latches in wire pipelining
Wire pipelining emerges as a new necessity for global wires due to increasing wire delay, shrinking clock period and growing chip size. Existing approaches on wire pipelining are ...
V. Seth, Min Zhao, Jiang Hu