Sciweavers

346 search results - page 35 / 70
» On the sizes of Delaunay meshes
Sort
View
VLSID
2006
IEEE
148views VLSI» more  VLSID 2006»
14 years 8 months ago
Efficient Design and Analysis of Robust Power Distribution Meshes
With increasing design complexity, as well as continued scaling of supplies, the design and analysis of power/ground distribution networks poses a difficult problem in modern IC d...
Puneet Gupta, Andrew B. Kahng
IFIP
2003
Springer
14 years 24 days ago
Collaborative and Distributed Computation in Mesh-Like Wireless Sensor Arrays
Sensor networks are being used for implementation of a large number of applications involving distributed and collaborative computation. Extensive research has focused upon design ...
Mitali Singh, Viktor K. Prasanna, José D. P...
COMCOM
2010
118views more  COMCOM 2010»
13 years 5 months ago
Mini-slot scheduling for IEEE 802.16d chain and grid mesh networks
This work considers the mini-slot scheduling problem in IEEE 802.16d wireless mesh networks (WMNs). An efficient mini-slot scheduling needs to take into account the transmission o...
Jia-Ming Liang, Ho-Cheng Wu, Jen-Jee Chen, Yu-Chee...
TPDS
1998
92views more  TPDS 1998»
13 years 7 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
VISUALIZATION
1999
IEEE
13 years 12 months ago
Efficient Compression of Non-Manifold Polygonal Meshes
We present a method for compressing non-manifold polygonal meshes, i.e., polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygon...
André Guéziec, Frank Bossen, Gabriel...