2354 search results - page 162 / 471 » Randomness, Stochasticity and Approximations |
WIRN
2005
Springer
14 years 2 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
TCS
2010
13 years 7 months ago
2010
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
OL
2011
13 years 4 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
ACSC
2005
IEEE
14 years 2 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
ESA
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...