Sciweavers

3946 search results - page 693 / 790
» The computational complexity of choice sets
Sort
View
BMCBI
2010
109views more  BMCBI 2010»
15 years 6 months ago
ParallABEL: an R library for generalized parallelization of genome-wide association studies
Background: Genome-Wide Association (GWA) analysis is a powerful method for identifying loci associated with complex traits and drug response. Parts of GWA analyses, especially th...
Unitsa Sangket, Surakameth Mahasirimongkol, Wasun ...
PODC
2011
ACM
14 years 9 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
ECCV
2004
Springer
16 years 8 months ago
Interactive Image Segmentation Using an Adaptive GMMRF Model
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
Andrew Blake, Carsten Rother, M. Brown, Patrick P&...
ECCV
2002
Springer
16 years 8 months ago
Multi-scale EM-ICP: A Fast and Robust Approach for Surface Registration
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
Sébastien Granger, Xavier Pennec
DAC
2002
ACM
16 years 7 months ago
The next chip challenge: effective methods for viable mixed technology SoCs
The next generation of computer chips will continue the trend for more complexity than their predecessors. Many of them will contain different chip technologies and are termed SoC...
H. Bernhard Pogge