Sciweavers

9405 search results - page 1115 / 1881
» Computing a Model of Set Theory
Sort
View
ACTA
2007
92views more  ACTA 2007»
15 years 7 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
IVC
2007
82views more  IVC 2007»
15 years 7 months ago
Cloud covering denoising through image fusion
This paper presents a solution to the cloud removal problem, based in a recently developed image fusion methodology consisting in applying a 1-D pseudo-Wigner distribution (PWD) t...
Salvador Gabarda, Gabriel Cristóbal
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
15 years 5 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
CVPR
2006
IEEE
16 years 9 months ago
Groupwise point pattern registration using a novel CDF-based Jensen-Shannon Divergence
In this paper, we propose a novel and robust algorithm for the groupwise non-rigid registration of multiple unlabeled point-sets with no bias toward any of the given pointsets. To...
Fei Wang, Baba C. Vemuri, Anand Rangarajan
BMCBI
2007
152views more  BMCBI 2007»
15 years 7 months ago
Recodon: Coalescent simulation of coding DNA sequences with recombination, migration and demography
Background: Coalescent simulations have proven very useful in many population genetics studies. In order to arrive to meaningful conclusions, it is important that these simulation...
Miguel Arenas, David Posada
« Prev « First page 1115 / 1881 Last » Next »