11160 search results - page 2232 / 2232 » Incompleteness in a General Setting |
COMPGEOM
2010
ACM
14 years 13 days ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
DIMACS
1996
13 years 8 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
BMCBI
2005
13 years 7 months ago
2005
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
SIAMMA
2011
12 years 10 months ago
2011
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...