Sciweavers

2079 search results - page 343 / 416
» Universality of random graphs
Sort
View
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
15 years 5 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
PVLDB
2008
122views more  PVLDB 2008»
15 years 3 months ago
Exploiting shared correlations in probabilistic databases
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...
Prithviraj Sen, Amol Deshpande, Lise Getoor
VIS
2009
IEEE
215views Visualization» more  VIS 2009»
16 years 5 months ago
Iconizer: A Framework to Identify and Create Effective Representations for Visual Information Encoding
concept form search query vision confirm consensus refine search query graphics VIE-designer image objects image objects Visual Sign (VIE) run search query words images Iconizer:...
Supriya Garg, Tamara Berg, Klaus Mueller
KDD
2008
ACM
224views Data Mining» more  KDD 2008»
16 years 4 months ago
The structure of information pathways in a social communication network
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
Gueorgi Kossinets, Jon M. Kleinberg, Duncan J. Wat...
DCC
2008
IEEE
16 years 3 months ago
On vector space partitions and uniformly resolvable designs
Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained ...
Andrew Blinco, Saad El-Zanati, G. F. Seelinger, P....