Sciweavers

5606 search results - page 385 / 1122
» Randomization Techniques for Graphs.
Sort
View
RECOMB
2007
Springer
16 years 7 months ago
Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms
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...
Yufeng Wu
ICALP
2009
Springer
16 years 7 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
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...
Martin Pál, Nitish Korula
ICCD
2004
IEEE
115views Hardware» more  ICCD 2004»
16 years 3 months ago
Generating Monitor Circuits for Simulation-Friendly GSTE Assertion Graphs
Formal and dynamic (simulation, emulation, etc.) verification techniques are both needed to deal with the overall challenge of verification. Ideally, the same specification/tes...
Kelvin Ng, Alan J. Hu, Jin Yang
ICIP
2006
IEEE
16 years 8 months ago
Semi-Automatic 3-D Segmentation of Anatomical Structures of Brain MRI Volumes using Graph Cuts
We present a semi-automatic segmentation technique of the anatomical structures of the brain: cerebrum, cerebellum, and brain stem. The method uses graph cuts segmentation with an...
Huy-Nam Doan, Gregory G. Slabaugh, Gozde B. Unal, ...
ICPR
2004
IEEE
16 years 7 months ago
A Graph-Based Approach to Corner Matching Using Mutual Information as a Local Similarity Measure
Corner matching constitutes a fundamental vision problem that serves as a building block of several important applications. The common approach to dealing with this problem starts...
Manolis I. A. Lourakis, Antonis A. Argyros, Kostas...