Sciweavers

801 search results - page 76 / 161
» Minimal Locked Trees
Sort
View
ICASSP
2010
IEEE
15 years 4 months ago
Unidirectional graph-based wavelet transforms for efficient data gathering in sensor networks
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
Sunil K. Narang, Godwin Shen, Antonio Ortega
ICCAD
2001
IEEE
152views Hardware» more  ICCAD 2001»
16 years 3 months ago
Hybrid Structured Clock Network Construction
This paper hierarchically constructs a hybrid mesh/tree clock network structure consisting of overlying zero-skew clock meshes, with underlying zero-skew clock trees originating f...
Haihua Su, Sachin S. Sapatnekar
MMSP
2008
IEEE
148views Multimedia» more  MMSP 2008»
16 years 22 days ago
Optimal server bandwidth allocation for streaming multiple streams via P2P multicast
—We consider the general scenario where content hosted by the server comprises streams and each peer can subscribe one or more streams. Multiple multicast trees are built to deli...
Aditya Mavlankar, Jeonghun Noh, Pierpaolo Bacciche...
IPPS
2005
IEEE
15 years 12 months ago
A Distributed Procedure for Bandwidth-Centric Scheduling of Independent-Task Applications
The problem of scheduling independent tasks on heterogeneous trees is considered. The nodes of the tree may have different processing times, and links different communication time...
Cyril Banino
COLT
1992
Springer
15 years 10 months ago
Polynomial Time Inference of a Subclass of Context-Free Transformations
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara