All Outputs (2741)

The weakest specifunction (2005)
Journal Article
Chen, Y., & Sanders, J. (2005). The weakest specifunction. Acta Informatica, 41(7-8), 383-414. https://doi.org/10.1007/s00236-005-0163-5

The weakest specifunction has been introduced to generalise the notions of weakest prespecification and weakest parallel environment. It calculates the weakest specification function whose value refines the target specification when applied to a give... Read More about The weakest specifunction.

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.

Surface Reconstruction with Neural Meshes. (2005)
Presentation / Conference Contribution
Ivrissimtzis, I., Jeong, W., Lee, S., Lee, Y. L., & Seidel, H. (2005). Surface Reconstruction with Neural Meshes. In M. Daehlen, K. Morken, & L. Schumaker (Eds.),

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..

A Non-parametric Approach to Realistic Surface Completion in 3D Environments (2005)
Presentation / Conference Contribution
Breckon, T., & Fisher, R. (2005). A Non-parametric Approach to Realistic Surface Completion in 3D Environments.

Optimal Distortion Parameter for the GPT Public-Key Cryptosystem (2005)
Presentation / Conference Contribution
Gadouleau, M., & Yan, Z. (2005). Optimal Distortion Parameter for the GPT Public-Key Cryptosystem. In Proc. IEEE Sarnoff Symposium (130-133)

A Requirements traceability to Support Change Impact Analysis (2005)
Journal Article
Ibrahim, S., Munro, M., & Deraman, A. (2005). A Requirements traceability to Support Change Impact Analysis. Asian journal of information technology, 4(4), 329-338

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). On the Computational Limits of Infinite Satisfaction.

Motion prediction for caching and prefetching in mouse-driven DVE navigation (2005)
Journal Article
Chan, A., Lau, R. W., & Ng, B. (2005). Motion prediction for caching and prefetching in mouse-driven DVE navigation. ACM Transactions on Internet Technology, 5(1), 70-91. https://doi.org/10.1145/1052934.1052937

A distributed virtual environment (DVE) allows geographically separated users to participate in a shared virtual environment via connected networks. However, when the users are connected by the Internet, bandwidth limitation and network latency may s... Read More about Motion prediction for caching and prefetching in mouse-driven DVE navigation.

The Complexity of Resolution with Generalized Symmetry Rules (2005)
Journal Article
Szeider, S. (2005). The Complexity of Resolution with Generalized Symmetry Rules. Theory of Computing Systems, 38(2), 171-188. https://doi.org/10.1007/s00224-004-1192-0

We generalize Krishnamurthys well-studied symmetry rule for resolution systems by considering homomorphisms instead of symmetries; symmetries are injective maps of literals whichpreserve complements and clauses; homomorphisms arise from symmetries by... Read More about The Complexity of Resolution with Generalized Symmetry Rules.

On the computational complexity of the rooted subtree prune and regraft distance (2005)
Journal Article
Bordewich, M., & Semple, C. (2005). On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics, 8(4), 409-423. https://doi.org/10.1007/s00026-004-0229-z

The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and reg... Read More about On the computational complexity of the rooted subtree prune and regraft distance.

The complexity of constraint satisfaction: an algebraic approach (2005)
Book Chapter
Krokhin, A., Bulatov, A., & Jeavons, P. (2005). The complexity of constraint satisfaction: an algebraic approach. In V. B. Kudryavtsev, & I. G. Rosenberg (Eds.), Structural theory of automata, semigroups, and universal algebra (181-213). Springer Netherlands. https://doi.org/10.1007/1-4020-3817-8_8

Many computational problems arising in artificial intelligence, computer science and elsewhere can be represented as constraint satisfaction and optimization problems. In this survey paper we discuss an algebraic approach that has proved to be very s... Read More about The complexity of constraint satisfaction: an algebraic approach.

A first step toward the semantic web (2004)
Book
Song, W., & Zhang, M. (2004). A first step toward the semantic web. Higher Education Press

Links for learning: linking for an adaptive learning environment (2004)
Presentation / Conference Contribution
Moore, A., Stewart, C., Martin, D., Brailsford, T., & Ashman, H. (2004). Links for learning: linking for an adaptive learning environment.

Identifying efficiently solvable cases of Max CSP (2004)
Presentation / Conference Contribution
Cohen, D., Cooper, M., Jeavons, P., & Krokhin, A. (2004). Identifying efficiently solvable cases of Max CSP. In M. Habib, & V. Diekert (Eds.),

Sensing the atmosphere on the upward path: LGSs without focal anisoplanatism for ELTs (2004)
Presentation / Conference Contribution
Love, G. D., Myers, R. M., Wilson, R. W., Buscher, D. F., Butterley, T., & Morris, T. J. (2004). Sensing the atmosphere on the upward path: LGSs without focal anisoplanatism for ELTs.

Cone-effect-free adaptive optics laser guide star development for the ELTs (2004)
Presentation / Conference Contribution
Bonaccini Calia, D., Myers, R. M., Zappa, F., Love, G. D., Morris, T. J., Hackenberg, W. K., …Buscher, D. F. (2004). Cone-effect-free adaptive optics laser guide star development for the ELTs.

Sky-projected Shack-Hartmann laser guide star (2004)
Presentation / Conference Contribution
Butterley, T., Buscher, D. F., Love, G. D., Morris, T. J., Myers, R. M., & Wilson, R. W. (2004). Sky-projected Shack-Hartmann laser guide star.

Authoring and delivering adaptive courseware (2004)
Journal Article
Stewart, C., Cristea, A., Moore, A., Brailsford, T., & Ashman, H. (2004). Authoring and delivering adaptive courseware

IDENTIFYING UNIFORMLY MUTATED SEGMENTS WITHIN REPEATS (2004)
Journal Article
Sahinalp, S. C., Eichler, E., Goldberg, P., Berenbrink, P., Friedetzky, T., & Ergun, F. (2004). IDENTIFYING UNIFORMLY MUTATED SEGMENTS WITHIN REPEATS. Journal of Bioinformatics and Computational Biology, 02(04), https://doi.org/10.1142/s0219720004000788