5606 search results - page 193 / 1122 » Randomization Techniques for Graphs. |
119
Voted
FCCM
2006
IEEE
15 years 4 months ago
2006
IEEE
This paper presents a technique for efficiently generating random numbers from a given probability distribution. This is achieved by using a generic hardware architecture, which t...
105
Voted
COCO
2007
Springer
15 years 6 months ago
2007
Springer
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
94
Voted
DAGM
2007
Springer
15 years 6 months ago
2007
Springer
Magnetic resonance spectral images provide information on metabolic processes and can thus be used for in vivo tumor diagnosis. However, each single spectrum has to be checked manu...
131
Voted
CPC
2010
14 years 10 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
112
Voted
TC
2008
15 years 19 days ago
2008
This work presents a novel slack management technique, the Service-Rate-Proportionate (SRP) Slack Distribution, for real-time distributed embedded systems to reduce energy consumpt...