Sciweavers

2479 search results - page 398 / 496
» Random Event Structures
Sort
View
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 10 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
EUROCRYPT
2009
Springer
14 years 10 months ago
Cube Attacks on Tweakable Black Box Polynomials
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
Itai Dinur, Adi Shamir
PODC
2009
ACM
14 years 10 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
14 years 10 months ago
User grouping behavior in online forums
Online forums represent one type of social media that is particularly rich for studying human behavior in information seeking and diffusing. The way users join communities is a re...
Xiaolin Shi, Jun Zhu, Rui Cai, Lei Zhang
INFOCOM
2007
IEEE
14 years 4 months ago
Reliable Broadcast in Wireless Networks with Probabilistic Failures
We consider the problem of reliable broadcast in a wireless network in which nodes are prone to failure. In the failure mode considered in this paper, each node can fail independe...
Vartika Bhandari, Nitin H. Vaidya