Sciweavers

3495 search results - page 23 / 699
» On the random satisfiable process
Sort
View
CPC
2007
125views more  CPC 2007»
13 years 10 months ago
Adversarial Deletion in a Scale-Free Random Graph Process
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
ICIAR
2007
Springer
14 years 2 months ago
Processing Random Amplified Polymorphysm DNA Images Using the Radon Transform and Mathematical Morphology
Abstract. Random Amplified Polymorphism DNA (RAPD) analysis is a wellknown method for studying genetic relationships between individuals. In this context, processing the underlying...
Luis Rueda, Omar Uyarte, Sofia Valenzuela, Jaime R...
ICASSP
2009
IEEE
14 years 5 months ago
Compressive spectral estimation for nonstationary random processes
We propose a “compressive” estimator of the Wigner-Ville spectrum (WVS) for time-frequency sparse, underspread, nonstationary random processes. A novel WVS estimator involving...
Alexander Jung, Georg Tauböck, Franz Hlawatsc...
CPC
2007
76views more  CPC 2007»
13 years 10 months ago
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...
Svante Janson, Joel Spencer
INFOCOM
2012
IEEE
12 years 26 days ago
On superposition of heterogeneous edge processes in dynamic random graphs
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov