Sciweavers

598 search results - page 37 / 120
» A random graph model for massive graphs
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 2 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
RSA
2006
104views more  RSA 2006»
13 years 11 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy
IPL
2011
88views more  IPL 2011»
13 years 6 months ago
Smooth movement and Manhattan path based Random Waypoint mobility
In this paper, we study the stationary node distribution of a variation of the Random Waypoint mobility model, in which nodes move in a smooth way following one randomly chosen Ma...
Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Do...
BMCBI
2010
189views more  BMCBI 2010»
13 years 11 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
GLOBECOM
2007
IEEE
14 years 5 months ago
Colouring Link-Directional Interference Graphs in Wireless Ad Hoc Networks
—In this paper, we clarify inter-link interference in wireless ad-hoc networks by using link-directional interference graphs (l-graph). Most of the interference graphs in the lit...
Ping Chung Ng, David J. Edwards, Soung Chang Liew