10608 search results - page 584 / 2122 » Complexity of O'Hara's Algorithm |
169
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
202
click to vote
WDAG
2005
Springer
16 years 19 days ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
195
click to vote
STOC
2010
ACM
15 years 12 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
207
click to vote
ICONIP
2007
15 years 8 months ago
2007
Abstract. Principal component analysis (PCA) is a widely used technique for data analysis and dimensionality reduction. Eigenvalue decomposition is the standard algorithm for solvi...
210
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...