Sciweavers

3708 search results - page 285 / 742
» Approximating Betweenness Centrality
Sort
View
ENTCS
2008
82views more  ENTCS 2008»
15 years 6 months ago
A Static Analysis for Beta-Binders
We introduce a Control Flow Analysis, that statically approximates the dynamic behaviour of processes, expressed in the Beta-Binders calculus. Our analysis of a system is able to ...
Chiara Bodei
JMLR
2006
97views more  JMLR 2006»
15 years 6 months ago
Distance Patterns in Structural Similarity
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
Thomas Kämpke
ALIFE
2002
15 years 6 months ago
Ant Colony Optimization and Stochastic Gradient Descent
In this paper, we study the relationship between the two techniques known as ant colony optimization (aco) and stochastic gradient descent. More precisely, we show that some empir...
Nicolas Meuleau, Marco Dorigo
CN
2002
112views more  CN 2002»
15 years 6 months ago
Performance evaluation of a queue fed by a Poisson Pareto burst process
This paper provides means for performance evaluation of a queue with Poisson Pareto Burst Process (PPBP) input. Because of the long range dependent nature of the PPBP, straightfor...
Ron Addie, Timothy D. Neame, Moshe Zukerman
BIOINFORMATICS
2011
15 years 1 months ago
Algorithms for sorting unsigned linear genomes by the DCJ operations
Motivation: The double cut and join operation (abbreviated as DCJ) has been extensively used for genomic rearrangement. Although the DCJ distance between signed genomes with both ...
Haitao Jiang, Binhai Zhu, Daming Zhu