Sciweavers

2100 search results - page 339 / 420
» Fundamentals of the problem
Sort
View
MST
2006
149views more  MST 2006»
13 years 9 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
BMCBI
2005
122views more  BMCBI 2005»
13 years 9 months ago
Bayesian coestimation of phylogeny and sequence alignment
Background: Two central problems in computational biology are the determination of the alignment and phylogeny of a set of biological sequences. The traditional approach to this p...
Gerton Lunter, István Miklós, Alexei...
AAMAS
2004
Springer
13 years 9 months ago
Autonomous Agents that Learn to Better Coordinate
A fundamental difficulty faced by groups of agents that work together is how to efficiently coordinate their efforts. This coordination problem is both ubiquitous and challenging,...
Andrew Garland, Richard Alterman
PAMI
2007
245views more  PAMI 2007»
13 years 8 months ago
Conformal Geometry and Its Applications on 3D Shape Matching, Recognition, and Stitching
—Three-dimensional shape matching is a fundamental issue in computer vision with many applications such as shape registration, 3D object recognition, and classification. However,...
Sen Wang, Yang Wang, Miao Jin, Xianfeng David Gu, ...
EXACT
2009
13 years 7 months ago
Explanations and Arguments Based on Practical Reasoning
In this paper a representative example is chosen that is meant be fairly simple for illustrating the point that in a very common kind of instance, argument and explanation are mixe...
Douglas Walton