5863 search results - page 137 / 1173 » Calculating Functional Programs |
106
Voted
COLING
1992
15 years 3 months ago
1992
Parsing a long sentence is very difficult, since long sentences often have conjunctions which result in ambiguities. If the conjunctive structures existing in a long sentence can ...
121
click to vote
EM
2010
15 years 2 months ago
2010
Abstract. The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and...
110
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
97
Voted
IJACTAICIT
2010
14 years 12 months ago
2010
This paper have shown an expert system design by using optimization methods for the Focused ion beam FIB optical system, by mixing the dynamic programming procedure and artificial...
108
Voted
TIT
2011
14 years 9 months ago
2011
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...