Sciweavers

1389 search results - page 232 / 278
» Parallel Algorithms for Treewidth Two
Sort
View
DCOSS
2005
Springer
15 years 3 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
ICPPW
2002
IEEE
15 years 2 months ago
Finding Multiple Routing Paths in Wide-Area WDM Networks
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
Weifa Liang, Xiaojun Shen
ASPDAC
2005
ACM
120views Hardware» more  ASPDAC 2005»
14 years 11 months ago
STACCATO: disjoint support decompositions from BDDs through symbolic kernels
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
Stephen Plaza, Valeria Bertacco
WINET
2010
145views more  WINET 2010»
14 years 8 months ago
Location-centric storage and query in wireless sensor networks
Location-centric storage (LCS) is envisioned as a promising scheme for robust and user-friendly ondemand data storage in networking environments such as the roadway sensor networks...
Kai Xing, Xiuzhen Cheng, Jiang Li, Min Song
ASPLOS
2009
ACM
15 years 10 months ago
StreamRay: a stream filtering architecture for coherent ray tracing
The wide availability of commodity graphics processors has made real-time graphics an intrinsic component of the human/computer interface. These graphics cores accelerate the z-bu...
Karthik Ramani, Christiaan P. Gribble, Al Davis