Sciweavers

4865 search results - page 932 / 973
» The Complexity of Graph Connectivity
Sort
View
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
13 years 11 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
EUSFLAT
2007
156views Fuzzy Logic» more  EUSFLAT 2007»
13 years 11 months ago
Fuzzy Calculating and Fuzzy Control in Wireless Sensor Network
At present time configurable wireless sensor networks are given special consideration. Wireless sensor networks are now a static elements union. To make such a network a powerful ...
Irina Kalganova
AVI
2004
13 years 11 months ago
Integrating expanding annotations with a 3D explosion probe
Understanding complex 3D virtual models can be difficult, especially when the model has interior components not initially visible and ancillary text. We describe new techniques fo...
Henry Sonnet, M. Sheelagh T. Carpendale, Thomas St...
ISCAPDCS
2004
13 years 11 months ago
One-Level Cache Memory Design for Scalable SMT Architectures
The cache hierarchy design in existing SMT and superscalar processors is optimized for latency, but not for bandwidth. The size of the L1 data cache did not scale over the past de...
Muhamed F. Mudawar, John R. Wani
IC
2003
13 years 11 months ago
Remote Real Laboratory: Linux Installation and Configuration
: Remote real laboratories deal with performing real lab experiments remotely via Internet. Recent advances in Internet/web technologies and computer-controlled instrumentation all...
Alassane Diop, Amine Berqia, Jürgen Harms