552 search results - page 67 / 111 » Lower bounds for dynamic connectivity |
167
click to vote
MICRO
2006
IEEE
15 years 12 months ago
2006
IEEE
Power delivery is a growing reliability concern in microprocessors as the industry moves toward feature-rich, powerhungrier designs. To battle the ever-aggravating power consumpti...
167
click to vote
CPM
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
162
click to vote
INFOCOM
2009
IEEE
16 years 14 days ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
186
click to vote
IJAHUC
2007
15 years 5 months ago
2007
: In wireless sensor networks, one of the main design challenges is to save severely constrained energy resources and obtain a long system lifetime. Low cost of sensors enables us ...
192
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...