Sciweavers

3008 search results - page 474 / 602
» Independence in connected graphs
Sort
View
186
Voted
ASPDAC
2005
ACM
127views Hardware» more  ASPDAC 2005»
16 years 19 days ago
Clock network minimization methodology based on incremental placement
: In ultra-deep submicron VLSI circuits, clock network is a major source of power consumption and power supply noise. Therefore, it is very important to minimize clock network size...
Liang Huang, Yici Cai, Qiang Zhou, Xianlong Hong, ...
GRAPHITE
2005
ACM
16 years 19 days ago
View-dependent tetrahedral meshing and rendering
We present a meshing and rendering framework for tetrahedral meshes that constructs a multi-resolution representation and uses this representation to adapt the mesh to rendering p...
Ralf Sondershaus, Wolfgang Straßer
PADS
2005
ACM
16 years 19 days ago
Performance Benchmark of a Parallel and Distributed Network Simulator
Simulation of large-scale networks requires enormous amounts of memory and processing time. One way of speeding up these simulations is to distribute the model over a number of co...
Samson Lee, John Leaney, Tim O'Neill, Mark Hunter
CCS
2005
ACM
16 years 18 days ago
A modular correctness proof of IEEE 802.11i and TLS
The IEEE 802.11i wireless networking protocol provides mutual authentication between a network access point and user devices prior to user connectivity. The protocol consists of s...
Changhua He, Mukund Sundararajan, Anupam Datta, An...
184
Voted
CRYPTO
2005
Springer
127views Cryptology» more  CRYPTO 2005»
16 years 18 days ago
One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
Secret-key agreement between two parties Alice and Bob, connected by an insecure channel, can be realized in an informationtheoretic sense if the parties share many independent pai...
Thomas Holenstein, Renato Renner