Sciweavers

314 search results - page 45 / 63
» Complete Problems for Dynamic Complexity Classes
Sort
View
ICEIS
1999
IEEE
15 years 1 months ago
Contour Estimation on Piecewise Homogeneous Random Fields
: Contour Estimation, Bayesian Estimation, Random Fields, Dynamic Programming, Multigrid Methods. This paper addresses contour estimation on images modeled as piecewise homogeneous...
José A. Moinhos Cordeiro, José M. B....
IVC
2007
102views more  IVC 2007»
14 years 9 months ago
Analysis of the rubberband algorithm
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
109
Voted
RECOMB
2002
Springer
15 years 10 months ago
Deconvolving sequence variation in mixed DNA populations
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
Andy Wildenberg, Steven Skiena, Pavel Sumazin
ECRTS
2005
IEEE
15 years 3 months ago
Scheduling Tasks with Markov-Chain Based Constraints
Markov-Chain (MC) based constraints have been shown to be an effective QoS measure for a class of real-time systems, particularly those arising from control applications. Scheduli...
Donglin Liu, Xiaobo Sharon Hu, Michael D. Lemmon, ...
RECOMB
1997
Springer
15 years 1 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...