Outputs (65)

Path coupling using stopping times (2005)
Presentation / Conference Contribution
Bordewich, M., Dyer, M., & Karpinski, M. (2005, August). Path coupling using stopping times. Presented at 15th International Symposium Fundamentals of Computation Theory : FCT 2005., Lubeck, Germany

We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics for independent sets in a hypergraph mixes rapidly as long as the maximum degree... Read More about Path coupling using stopping times.

Jason and the Golden Fleece of agent-oriented programming (2005)
Book Chapter
Bordini, R. H., Hübner, J. F., & Vieira, R. (2005). Jason and the Golden Fleece of agent-oriented programming. In R. H. Bordini, M. Dastani, J. Dix, & A. El Fallah Seghrouchni (Eds.), Multi-agent programming : languages, platforms and applications (3-37). Springer Verlag

A Comparison of Network Level Fault Injection with Code Insertion (2005)
Presentation / Conference Contribution
Looker, N., Munro, M., & Xu, J. (2005, July). A Comparison of Network Level Fault Injection with Code Insertion. Presented at International Computer Software and Applications Conference, (COMPSAC, Edinburgh, UK

LFTOP : an LF-based approach to domain-specific reasoning (2005)
Journal Article
Pang, J., Callaghan, P., & Luo, Z. (2005). LFTOP : an LF-based approach to domain-specific reasoning. Journal of Computer Science and Technology, 20(4), 526-535. https://doi.org/10.1007/s11390-005-0526-y

A new approach to domain-specific reasoning is presented that is based on a type-theoretic logical framework (LF) but does not require the user to be an expert in type theory. The concepts of the domain and its related reasoning systems are formalize... Read More about LFTOP : an LF-based approach to domain-specific reasoning.

A Private-Key Cryptosystem Based on the Rank Metric (2005)
Presentation / Conference Contribution
Gadouleau, M., & Yan, Z. (2005, July). A Private-Key Cryptosystem Based on the Rank Metric. Presented at Algebraic Methods in Cryptography Workshop, Beijing. China

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.

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.

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.