1542 search results - page 210 / 309 » The metamathematics of random graphs |
130
click to vote
IM
2007
15 years 1 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
121
click to vote
RECOMB
2007
Springer
16 years 2 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
118
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
CORR
2007
Springer
15 years 1 months ago
2007
Springer
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
148
click to vote
MICCAI
2008
Springer
16 years 2 months ago
2008
Springer
In this paper we present a fully automated approach to the segmentation of pediatric brain tumors in multi-spectral 3-D magnetic resonance images. It is a top-down segmentation app...