Sciweavers

1117 search results - page 39 / 224
» Equivalent Representations of Set Functions
Sort
View
BMCBI
2007
147views more  BMCBI 2007»
14 years 9 months ago
Hon-yaku: a biology-driven Bayesian methodology for identifying translation initiation sites in prokaryotes
Background: Computational prediction methods are currently used to identify genes in prokaryote genomes. However, identification of the correct translation initiation sites remain...
Yuko Makita, Michiel J. L. de Hoon, Antoine Danchi...
MFCS
2009
Springer
15 years 2 months ago
Time-Bounded Kolmogorov Complexity and Solovay Functions
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
Rupert Hölzl, Thorsten Kräling, Wolfgang...
SCALESPACE
2005
Springer
15 years 3 months ago
Sparse Finite Element Level-Sets for Anisotropic Boundary Detection in 3D Images
Level-Set methods have been successfully applied to 2D and 3D boundary detection problems. The geodesic active contour model has been particularly successful. Several algorithms fo...
Martin Weber, Andrew Blake, Roberto Cipolla
DM
2006
73views more  DM 2006»
14 years 9 months ago
Composition of Post classes and normal forms of Boolean functions
The class composition C K of Boolean clones, being the set of composite functions f(g1, . . . , gn) with f C, g1, . . . , gn K, is investigated. This composition C K is either...
Miguel Couceiro, Stephan Foldes, Erkko Lehtonen
ECSQARU
2007
Springer
15 years 3 months ago
Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory
The binary representation is widely used for representing focal sets of Dempster-Shafer belief functions because it allows to compute efficiently all relevant operations. However, ...
Norbert Lehmann