1333 search results - page 133 / 267 » Not a Number of Floating Point Problems |
137
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
126
click to vote
CVPR
2010
IEEE
16 years 1 days ago
2010
IEEE
In this paper we consider the problem of outlier removal for large scale multiview reconstruction problems. An efficient and very popular method for this task is RANSAC. However, a...
153
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
114
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
The tagging problem in natural language processing is to find a way to label every word in a text as a particular part of speech, e.g., proper noun. An effective way of solving th...
115
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...