Sciweavers

1346 search results - page 39 / 270
» On the number of rectangular partitions
Sort
View
CLEIEJ
2010
13 years 4 months ago
3D-Via Driven Partitioning for 3D VLSI Integrated Circuits
A 3D circuit is the stacking of regular 2D circuits. The advances on the fabrication and packaging technologies allowed interconnecting stacked 2D circuits by using 3D vias. Howeve...
Sandro Sawicki, Gustavo Wilke, Marcelo O. Johann, ...
VTC
2007
IEEE
14 years 1 months ago
Time Slot Partitioning and Random Data Hopping for TDD Based Multihop Wireless Networks
Abstract— A multihop ad hoc wireless network with an interference avoidance model is analyzed for a time division duplex (TDD) air-interface. In accordance with the non-interfere...
Hrishikesh Venkataraman, Abdurazak Mudesir, Sinan ...
MOBIDE
1999
ACM
13 years 11 months ago
Data Partitioning for Disconnected Client Server Databases
The use of mobile computers is gaining popularity. The number of users with laptops and notebooks is increasing and this trend is likely to continue in the future where the number...
Shirish Hemant Phatak, B. R. Badrinath
ENDM
2007
140views more  ENDM 2007»
13 years 7 months ago
Acyclic dominating partitions
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
Louigi Addario-Berry, Ross J. Kang
CAGD
2004
76views more  CAGD 2004»
13 years 7 months ago
Mesh quality improvement and other properties in the four-triangles longest-edge partition
The four-triangles longest-edge (4T-LE) partition of a triangle t is obtained by joining the midpoint of the longest edge of t to the opposite vertex and to the midpoints of the t...
Angel Plaza, José P. Suárez, Miguel ...