5606 search results - page 186 / 1122 » Randomization Techniques for Graphs. |
82
Voted
DATE
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper, we present an accurate but very fast soft error rate (SER) estimation technique for digital circuits based on error propagation probability (EPP) computation. Exper...
108
click to vote
FOCS
1998
IEEE
15 years 5 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
112
Voted
SDM
2007
SIAM
15 years 2 months ago
2007
SIAM
In recent years, random projection has been used as a valuable tool for performing dimensionality reduction of high dimensional data. Starting with the seminal work of Johnson and...
113
click to vote
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
104
click to vote
EMNLP
2006
15 years 2 months ago
2006
Random Indexing is a vector space technique that provides an efficient and scalable approximation to distributional similarity problems. We present experiments showing Random Inde...