Sciweavers

23 search results - page 2 / 5
» damon 2008
Sort
View
ORL
2008
115views more  ORL 2008»
13 years 4 months ago
Maximum algebraic connectivity augmentation is NP-hard
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
Damon Mosk-Aoyama
CCR
2005
104views more  CCR 2005»
13 years 4 months ago
Part I: buffer sizes for core routers
In this article we describe recent work on buffer sizing for core Internet routers. This work suggests that the widelyused rule of thumb leads to buffers which are much larger tha...
Damon Wischik, Nick McKeown
SECON
2008
IEEE
13 years 11 months ago
Making Sensor Networks Accessible to Undergraduates Through Activity-Based Laboratory Materials
In 2003, the MIT Technology Review magazine listed wireless sensor networks as one of “Ten Emerging Technologies That Will Change the World” [2]. Five years later, are wireles...
Jens Mache, Damon Tyman, Nirupama Bulusu
DAMON
2008
Springer
13 years 6 months ago
CAM conscious integrated answering of frequent elements and top-k queries over data streams
Frequent elements and top-k queries constitute an important class of queries for data stream analysis applications. Certain applications require answers for both frequent elements...
Sudipto Das, Divyakant Agrawal, Amr El Abbadi
DAMON
2008
Springer
13 years 6 months ago
Modeling the performance of algorithms on flash memory devices
NAND flash memory is fast becoming popular as a component of large scale storage devices. For workloads requiring many random I/Os, flash devices can provide two orders of magnitu...
Kenneth A. Ross