Sciweavers

5100 search results - page 35 / 1020
» The Linear Complexity of a Graph
Sort
View
ICASSP
2007
IEEE
14 years 2 months ago
Particle PHD Filtering for Multi-Target Visual Tracking
We propose a multi-target tracking algorithm based on the Probability Hypothesis Density (PHD) filter and data association using graph matching. The PHD filter is used to compen...
Emilio Maggio, Elisa Piccardo, Carlo S. Regazzoni,...
LATIN
1995
Springer
13 years 11 months ago
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
David Fernández-Baca, Giora Slutzki
GECCO
2000
Springer
113views Optimization» more  GECCO 2000»
13 years 11 months ago
A Non-Linear Schema Theorem for Genetic Algorithms
We generalize Holland's Schema Theorem to the setting that genes are arranged, not necessarily in a linear sequence, but as the nodes in a connected graph. We have experiment...
William A. Greene
SAC
2005
ACM
14 years 1 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq
DM
2011
264views Education» more  DM 2011»
13 years 2 months ago
Connectivity threshold and recovery time in rank-based models for complex networks
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat