Sciweavers

2079 search results - page 167 / 416
» Universality of random graphs
Sort
View
DAGM
2007
Springer
16 years 21 days ago
Semi-supervised Tumor Detection in Magnetic Resonance Spectroscopic Images Using Discriminative Random Fields
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...
L. Görlitz, Bjoern H. Menze, M.-A. Weber, B. ...
CPC
2010
117views more  CPC 2010»
15 years 3 months ago
On the Number of Perfect Matchings in Random Lifts
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)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...
COLT
2008
Springer
15 years 8 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin
SDM
2008
SIAM
164views Data Mining» more  SDM 2008»
15 years 8 months ago
Randomizing Social Networks: a Spectrum Preserving Approach
Understanding the general properties of real social networks has gained much attention due to the proliferation of networked data. The nodes in the network are the individuals and...
Xiaowei Ying, Xintao Wu
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 7 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler