503 search results - page 51 / 101 » Probabilistic Weighted Automata |
CIKM
2005
Springer
14 years 2 months ago
2005
Springer
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
CISST
2004
13 years 10 months ago
2004
Probabilistic feature relevance learning (PFRL) is an effective method for adaptively computing local feature relevance in content-based image retrieval. It computes flexible retr...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
COLT
2006
Springer
14 years 13 days ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomia...