Sciweavers

5115 search results - page 27 / 1023
» On Randomized Lanczos Algorithms
Sort
View
WIRN
2005
Springer
14 years 26 days ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini
STACS
2004
Springer
14 years 22 days ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
COMBINATORICA
2010
13 years 4 months ago
A randomized embedding algorithm for trees
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Benny Sudakov, Jan Vondrák
FCS
2006
13 years 8 months ago
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
Yongsheng Bai, Bob P. Weems
IJBC
2010
80views more  IJBC 2010»
13 years 4 months ago
Symbolic Dynamical Model of Average Queue Size of Random Early Detection Algorithm
In this paper, a symbolic dynamical model of the average queue size of the random early detection (RED) algorithm is proposed. The conditions on both the system parameters and the...
Charlotte Yuk-Fan Ho, Bingo Wing-Kuen Ling, Herber...