116 search results - page 9 / 24 » Fundamental Network Processor Performance Bounds |
71
Voted
GLVLSI
2003
IEEE
15 years 2 months ago
2003
IEEE
In this work we ask the fundamental question: How many bits of information can be stored in a crossbar switching network? The answer is trivial when the switches of the network ar...
TDSC
2010
14 years 4 months ago
2010
Network survivability is the ability of a network keeping connected under failures and attacks, which is a fundamental issue to the design and performance evaluation of wireless ad...
ADHOCNOW
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
155
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
PODC
2006
ACM
15 years 3 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...