Sciweavers

1480 search results - page 60 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
FCT
2007
Springer
13 years 11 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
ICPP
1999
IEEE
13 years 12 months ago
The Index-Permutation Graph Model for Hierarchical Interconnection Networks
In this paper, we present the index-permutation (IP) graph model, and apply it to the systematic development of efficient hierarchical networks. We derive several classes of inter...
Chi-Hsiang Yeh, Behrooz Parhami
CVPR
2011
IEEE
12 years 11 months ago
Robust Tracking Using Local Sparse Appearance Model and K-Selection
Online learned tracking is widely used for it’s adaptive ability to handle appearance changes. However, it introduces potential drifting problems due to the accumulation of erro...
Baiyang Liu, junzhou Huang, Casimir Kulikowski, Li...
CEC
2009
IEEE
14 years 2 months ago
The multiobjective evolutionary algorithm based on determined weight and sub-regional search
— By dividing the multiobjective optimization of the decision space into several small regions, this paper proposes multi-objective optimization algorithm based on sub-regional s...
Hai-lin Liu, Xueqiang Li
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 9 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos