Sciweavers

1388 search results - page 151 / 278
» Approximability of Robust Network Design
Sort
View
162
Voted
SENSYS
2006
ACM
16 years 2 days ago
The tenet architecture for tiered sensor networks
Most sensor network research and software design has been guided by an architectural principle that permits multi-node data fusion on small-form-factor, resource-poor nodes, or mo...
Omprakash Gnawali, Ki-Young Jang, Jeongyeup Paek, ...
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
16 years 6 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
SPAA
2004
ACM
15 years 11 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
INFOCOM
2008
IEEE
16 years 16 days ago
Dynamic Bandwidth Request-Allocation Algorithm for Real-Time Services in IEEE 802.16 Broadband Wireless Access Networks
—The emerging broadband wireless access (BWA) technology based on IEEE 802.16 is one of the most promising solutions to provide ubiquitous wireless access to the broadband servic...
Eun-Chan Park, Hwangnam Kim, Jae-Young Kim, Han Se...
MOBIQUITOUS
2007
IEEE
16 years 12 days ago
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
Shanshan Jiang, Yuan Xue, Douglas C. Schmidt