The Open UniversitySkip to content

Browse by Journal

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0 [Create Shortened URL] SURL
Group by: Published Date | Item Type | No Grouping
Jump to: 2014 | 2010 | 2007 | 2006 | 2005 | 1999
Number of items: 7.


Bromley, Jane M.; King, David and Morse, David R. (2014). Finding agriculture among biodiversity: metadata in practice. In: 8th Metadata and Semantics Research Conference (MTSR 2014), 27-29 November 2014, Karlsruhe, Springer International Publishing, pp. 185–192. file


Blümlein, J.; Broadhurst, D. J. and Vermaseren, J. A. M. (2010). The multiple zeta value data mine. Computer Physics Communications, 181(3) pp. 582–625. file


Iqbal, Mudasser M.; Gondal, Iqbal and Dooley, Laurence S. (2007). HUSEC: A heuristic self configuration model for wireless sensor networks. Computer Communications, 30(7) pp. 1624–1640.


Huang, Helen; Zhou, Xiaofang; Song, Dawei and Bruza, Peter (2006). Dimensionality reduction in patch-signature based protein structure matching. In: Dobbie, Gillian and Bailey, James eds. ADC '06 Proceedings of the 17th Australasian Database Conference , Volume 49. Darlinghurst, Australia: Australian Computer Society, pp. 89–97. file

Yan, Xin; Li, Xue and Song, Dawei (2006). Document generality: its computation for ranking. Australian Computer Science Communications, 28(2) pp. 109–118. file


Sorwar, Golam; Murshed, Manzur and Dooley, Laurence S. (2005). Filtering of Block Motion Vectors for Use in Motion-Based Video Indexing and Retrieval. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E88-A(10 Special Section on Nonlinear Theory and its Applications) pp. 2593–2599.


Schreiber, Michael; Grimm, Uwe; Roemer, Rudolf A. and Zhong, Jianxin (1999). Energy levels of quasiperiodic Hamiltonians, spectral unfolding, and random matrix theory. Computer Physics Communications, 121-122 pp. 499–501.

This list was generated on Fri Nov 27 21:59:49 2015 GMT.

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340