Skip to main content

Research Repository

Advanced Search

Outputs (3164)

The application of use cases in systems analysis and design specification (2005)
Journal Article
Martyn, R., & Budgen, D. (2005). The application of use cases in systems analysis and design specification. Information and Software Technology, 47(9), 623-641. https://doi.org/10.1016/j.infsof.2004.11.003

The paper begins by reviewing the application of use cases in the analysis and design phases of software development. At present, a use case derived in analysis is generally mapped into design through the synthesis of object behaviour for all scenari... Read More about The application of use cases in systems analysis and design specification.

Non-parametric 3D Surface Completion (2005)
Presentation / Conference Contribution
Breckon, T., & Fisher, R. (2005, June). Non-parametric 3D Surface Completion. Presented at Proc. Fifth International Conference on 3D Digital Imaging and Modeling

Surface Reconstruction with Neural Meshes. (2005)
Presentation / Conference Contribution
Ivrissimtzis, I., Jeong, W.-K., Lee, S., Lee, Y. L., & Seidel, H.-P. (2005, May). Surface Reconstruction with Neural Meshes. Presented at Mathematical Methods for Curves and Surfaces., Tromsoe, Norway

We describe a Learning algorithm for surface reconstruction based on an incrementally expanding Neural Network known as Growing Cell Structure. The Neural Network (Neural Mesh) expands by splitting its most active vertices and removing its least acti... Read More about Surface Reconstruction with Neural Meshes..

Classifying the complexity of constraints using finite algebras (2005)
Journal Article
Bulatov, A., Jeavons, P., & Krokhin, A. (2005). Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing, 34(3), 720-742. https://doi.org/10.1137/s0097539700376676

Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. Here we show that... Read More about Classifying the complexity of constraints using finite algebras.

On the Computational Limits of Infinite Satisfaction. (2005)
Presentation / Conference Contribution
Dantchev, S., & Valencia, F. (2005, March). On the Computational Limits of Infinite Satisfaction. Presented at The 20th Annual ACM Symposium on Applied Computing, Santa Fe, USA

Multi-shared-trees based multicast routing control protocol using anycast selection (2005)
Journal Article
Jia, W., Tu, W., Zhao, W., & Xu, G. (2005). Multi-shared-trees based multicast routing control protocol using anycast selection. International Journal of Parallel, Emergent and Distributed Systems, 20(1), 69-84. https://doi.org/10.1080/17445760500033317

A novel internet multicast routing protocol is presented to possess efficiency and effectiveness for multicast packet routing with short delay, high throughput, resource utilization and scalability for a single multicast group g. The protocol has two... Read More about Multi-shared-trees based multicast routing control protocol using anycast selection.