Sciweavers

1284 search results - page 147 / 257
» Connectivity in Bag Generation
Sort
View
TIT
1998
89views more  TIT 1998»
15 years 6 months ago
The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels
—We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e., ...
Sivarama Venkatesan, Venkat Anantharam
JUCS
2010
157views more  JUCS 2010»
15 years 4 months ago
Entropy Optimization of Social Networks Using an Evolutionary Algorithm
: Recent work on social networks has tackled the measurement and optimization of these networks’ robustness and resilience to both failures and attacks. Different metrics have be...
Maytham Safar, Nosayba El-Sayed, Khaled Mahdi, Dav...
EUROMED
2010
15 years 4 months ago
New Instruments and Technologies for Cultural Heritage Survey: Full Integration between Point Clouds and Digital Photogrammetry
In the last years the Geomatic Research Group of the Politecnico di Torino faced some new research topics about new instruments for point cloud generation (e.g. Time of Flight came...
F. Rinaudo, F. Chiabrando, F. Nex, D. Piatti
ET
2010
122views more  ET 2010»
15 years 3 months ago
Fault Models for Quantum Mechanical Switching Networks
This work justifies several quantum gate level fault models and discusses the causal error mechanisms thwarting correct function. A quantum adaptation of the classical test set gen...
Jacob D. Biamonte, Jeff S. Allen, Marek A. Perkows...
JCT
2011
86views more  JCT 2011»
15 years 1 months ago
Descendant-homogeneous digraphs
The descendant set desc(α) of a vertex α in a digraph D is the set of vertices which can be reached by a directed path from α. A subdigraph of D is finitely generated if it is...
Daniela Amato, John K. Truss