3495 search results - page 23 / 699 » On the random satisfiable process |
134
Voted
CPC
2007
15 years 3 months ago
2007
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...
118
Voted
ICIAR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Random Amplified Polymorphism DNA (RAPD) analysis is a wellknown method for studying genetic relationships between individuals. In this context, processing the underlying...
133
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
We propose a “compressive” estimator of the Wigner-Ville spectrum (WVS) for time-frequency sparse, underspread, nonstationary random processes. A novel WVS estimator involving...
141
click to vote
CPC
2007
15 years 3 months ago
2007
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/...
157
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—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...