5606 search results - page 217 / 1122 » Randomization Techniques for Graphs. |
101
Voted
BIOWIRE
2007
Springer
15 years 7 months ago
2007
Springer
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. In particular, r...
126
Voted
CSCLP
2005
Springer
15 years 6 months ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
115
Voted
ISSRE
2010
IEEE
14 years 10 months ago
2010
IEEE
Buffer overflow is known to be a common memory vulnerability affecting software. It is exploited to gain various kinds of privilege escalation. C and C++ are very commonly used to ...
163
click to vote
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
We propose a novel stochastic graph matching algorithm based on data-driven Markov Chain Monte Carlo (DDMCMC) sampling technique. The algorithm explores the solution space efficien...
87
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
We consider the problem of aligned coloring of interval and chordal graphs. These problems have substantial applications to register allocation in compilers and have recently been ...