Sciweavers

2310 search results - page 241 / 462
» Coloring Random Graphs
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
Learning to localize detected objects
In this paper, we propose an approach to accurately localize detected objects. The goal is to predict which features pertain to the object and define the object extent with segme...
Qieyun Dai, Derek Hoiem
COCO
2007
Springer
96views Algorithms» more  COCO 2007»
14 years 2 months ago
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
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 ...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
DAGM
2007
Springer
14 years 2 months 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»
13 years 5 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
13 years 10 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