71228 search results - page 388 / 14246 » Algorithms |
225
click to vote
LATIN
1995
Springer
15 years 11 months ago
1995
Springer
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...
182
click to vote
STOC
1991
ACM
15 years 11 months ago
1991
ACM
act We give an algorithm for imbedding a graph G of n vertices onto an oriented surface of minimal genus g. If g > 0 then we also construct a forbidden subgraph of G which is ho...
190
click to vote
STOC
1991
ACM
15 years 11 months ago
1991
ACM
In this paper, we prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the k-server problem, suggested by [MMS], and an on-line motion-pl...
194
Voted
WSC
2008
15 years 9 months ago
2008
We propose a framework for optimization problems based on particle filtering (also called Sequential Monte Carlo method). This framework unifies and provides new insight into rand...
175
Voted
CSC
2008
15 years 9 months ago
2008
Abstract - In this paper, we present a rankrevealing two-sided orthogonal decomposition method for solving the STLS problem. An error analysis of the algorithm is given. Our numeri...