Result 1 to 20 from 29 total
Using Markov chains to analyze changes in wetland trends in arid Yinchuan plain, China. (English)
Math. Comput. Modelling 54, No. 3-4, 924-930 (2011).
1
Not every domain of a plain decompressor contains the domain of a prefix-free one. (English)
Theor. Comput. Sci. 412, No. 4-5, 482-486 (2011).
2
Latent fingerprint matching: Fusion of rolled and plain fingerprints. (English)
Tistarelli, Massimo (ed.) et al., Advances in biometrics. Third international conference, ICB 2009, Alghero, Italy, June 2‒5, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-01792-6/pbk). Lecture Notes in Computer Science 5558, 695-704 (2009).
3
Degrees of belief. (English)
J. Log. Comput. 18, No. 5, 699-719 (2008).
4
An integrated classification method for thematic mapper imagery of plain and highland terrains. (English)
J. Zhejiang Univ., Sci. A 9, No. 6, 858-866 (2008).
5
Usable and accessible plain language (easy-to-read) network service. (English)
Miesenberger, Klaus (ed.) et al., Computers helping people with special needs. 11th international conference, ICCHP 2008, Linz, Austria, July 9‒11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-70539-0/pbk). Lecture Notes in Computer Science 5105, 755-758 (2008).
6
On initial segment complexity and degrees of randomness. (English)
Trans. Am. Math. Soc. 360, No. 6, 3193-3210 (2008).
7
Monte Carlo methods for applied scientists. (English)
Hackensack, NJ: World Scientific (ISBN 978-981-02-2329-8/hbk; 978-981-277-989-2/ebook). xv, 291~p. \sterling~42.00; \$~78.00 (2008).
8
Enhancing dependency pair method using strong computability in simply-typed term rewriting. (English)
Appl. Algebra Eng. Commun. Comput. 18, No. 5, 407-431 (2007).
9
Grover quantum algorithm and security analysis of DES. (Chinese)
J. Hunan Univ. Arts Sci., Nat. Sci. 18, No. 3, 78-79 (2006).
10
Efficient algorithms for parameterized $H$-colorings. (English)
Klazar, Martin (ed.) et al., Topics in discrete mathematics. Dedicated to Jarik Nešetril on the occasion of his 60th birthday. Berlin: Springer (ISBN 3-540-33698-2/hbk). Algorithms and Combinatorics 26, 373-405 (2006).
11
Monoid presentations of groups by finite special string-rewriting systems. (English)
Theor. Inform. Appl. 38, No. 3, 245-256 (2004).
12
A note on the existential theory of equations in plain groups. (English)
Int. J. Algebra Comput. 12, No.1-2, 1-7 (2002).
13
Pseudo-outer product based fuzzy neural network fingerprint verification system. (English)
Neural Netw. 14, No. 3, 305-323 (2001).
14
Plane trees with special primitive edge rotation groups. (Russian)
Fundam. Prikl. Mat. 3, No.4, 1085-1092 (1997).
15
Modelling megalithic sites. (English)
Comput. Graph. Forum 15, No. 3, 279-288 (1996).
16
An occurence-based model of word categorization. (English)
Ann. Math. Artif. Intell. 14, No. 1, 1-16 (1995).
17
Axiomatization and completeness of uncountably valued approximation logic. (English)
Stud. Log. 53, No.1, 137-160 (1994).
18
Belief contraction in the context of the general theory of rational choice. (English)
J. Symb. Log. 58, No.4, 1426-1450 (1993).
19
Cayley graphs of virtually free groups. (English)
Int. J. Algebra Comput. 3, No.2, 189-199 (1993).
20
Result 1 to 20 from 29 total
Start
Contact
Print
General Help
