Sciweavers

307 search results - page 33 / 62
» Low-Distortion Embeddings of Trees
Sort
View
RTCSA
2008
IEEE
14 years 2 months ago
Real-Time Communications Over Cluster-Tree Sensor Networks with Mobile Sink Behaviour
· Modelling the fundamental performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand the behaviour of WSN under worst-case conditions and to...
Petr Jurcík, Ricardo Severino, Anis Koubaa,...
TCAD
2008
100views more  TCAD 2008»
13 years 7 months ago
Robust Clock Tree Routing in the Presence of Process Variations
Abstract--Advances in very large-scale integration technology make clock skew more susceptible to process variations. Notwithstanding efficient exact zero-skew algorithms, clock sk...
Uday Padmanabhan, Janet Meiling Wang, Jiang Hu
SIAMCOMP
2008
78views more  SIAMCOMP 2008»
13 years 7 months ago
I/O-Efficient Planar Separators
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
Anil Maheshwari, Norbert Zeh
INFOCOM
2009
IEEE
14 years 2 months ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
ENTCS
2006
150views more  ENTCS 2006»
13 years 7 months ago
Causality Versus True-Concurrency
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Sibylle B. Fröschle, Slawomir Lasota