Sciweavers

2304 search results - page 397 / 461
» On the Vulnerability of Large Graphs
Sort
View
CISS
2008
IEEE
13 years 10 months ago
Detection of anomalous meetings in a social network
Abstract-- When monitoring interactions within a social network, meetings or contacts between different members of the network are recorded. This paper addresses the problem of usi...
Jorge Silva, Rebecca Willett
AC
2008
Springer
13 years 10 months ago
Distributed Sparse Matrices for Very High Level Languages
Sparse matrices are first class objects in many VHLLs (very high level languages) used for scientific computing. They are a basic building block for various numerical and combinat...
John R. Gilbert, Steve Reinhardt, Viral Shah
CN
2010
103views more  CN 2010»
13 years 10 months ago
Continuum equilibria and global optimization for routing in dense static ad hoc networks
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
Alonso Silva, Eitan Altman, Pierre Bernhard, M&eac...
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
13 years 10 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 10 months ago
Structure of random r-SAT below the pure literal threshold
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...
Alexander D. Scott, Gregory B. Sorkin