Sciweavers

721 search results - page 94 / 145
» Almost universal graphs
Sort
View
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 10 months ago
Probabilistic Analysis of Linear Programming Decoding
Abstract—We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code e...
Constantinos Daskalakis, Alexandros G. Dimakis, Ri...
CIKM
2010
Springer
13 years 8 months ago
Understanding retweeting behaviors in social networks
Retweeting is an important action (behavior) on Twitter, indicating the behavior that users re-post microblogs of their friends. While much work has been conducted for mining text...
Zi Yang, Jingyi Guo, Keke Cai, Jie Tang, Juanzi Li...
ICST
2010
IEEE
13 years 8 months ago
Repairing GUI Test Suites Using a Genetic Algorithm
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
Si Huang, Myra B. Cohen, Atif M. Memon
TIT
2010
82views Education» more  TIT 2010»
13 years 4 months ago
Average message delivery time for small-world networks in the continuum limit
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
Hazer Inaltekin, Mung Chiang, H. Vincent Poor
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
12 years 5 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman