Sciweavers

654 search results - page 27 / 131
» Ordered Sets and Complete Lattices
Sort
View
ISCIS
2004
Springer
14 years 29 days ago
Stubborn Sets for Priority Nets
Partial order methods, such as the stubborn set method and the priority method, reduce verification effort by exploiting irrelevant orders of events. We show how the stubborn set...
Kimmo Varpaaniemi
FROCOS
2000
Springer
13 years 11 months ago
Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
Paqui Lucio
ISBI
2002
IEEE
14 years 8 months ago
A new convergent MAP reconstruction algorithm for emission tomography using ordered subsets and separable surrogates
We investigate a new, fast and provably convergentMAP reconstruction algorithm for emission tomography. The new algorithm, termed C-OSEM has its origin in the alternating algorith...
Ing-Tsung Hsiao, Anand Rangarajan, Gene Gindi
BMCBI
2005
81views more  BMCBI 2005»
13 years 7 months ago
Evolutionary sequence analysis of complete eukaryote genomes
Background: Gene duplication and gene loss during the evolution of eukaryotes have hindered attempts to estimate phylogenies and divergence times of species. Although current meth...
Jaime E. Blair, Prachi Shah, S. Blair Hedges
BMCBI
2007
161views more  BMCBI 2007»
13 years 7 months ago
Efficient classification of complete parameter regions based on semidefinite programming
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
Lars Kuepfer, Uwe Sauer, Pablo A. Parrilo