Adaptive Modally Addressed Liquid Crystal Lenses
(2004)
Journal Article
Hands, P., Kirby, A., & Love, G. (2004). Adaptive Modally Addressed Liquid Crystal Lenses. Proceedings of SPIE, 5518, 136-143
Outputs (24)
Multiconjugate adaptive optics: laboratory experience (2004)
Journal Article
Langlois, M., Saunter, C., Dunlop, C., Myers, R., & Love, G. (2004). Multiconjugate adaptive optics: laboratory experience. Optics Express, 12(8), 1689-1699
Simulating Errors in Web Services. (2004)
Journal Article
Looker, N., Munro, M., & Xu, J. (2004). Simulating Errors in Web Services. International journal of simulation: systems, science & technology, 5(5), 29-37
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
A first step toward the semantic web (2004)
Book
Song, W., & Zhang, M. (2004). A first step toward the semantic web. Higher Education Press
Recognizing frozen variables in constraint satisfaction problems (2004)
Journal Article
Jonsson, P., & Krokhin, A. (2004). Recognizing frozen variables in constraint satisfaction problems. Theoretical Computer Science, 329(1-3), 93-113. https://doi.org/10.1016/j.tcs.2004.08.006In constraint satisfaction problems over finite domains, some variables can be frozen, that is, they take the same value in all possible solutions. We study the complexity of the problem of recognizing frozen variables with restricted sets of constra... Read More about Recognizing frozen variables in constraint satisfaction problems.
Complexity classification in qualitative temporal constraint reasoning (2004)
Journal Article
Jonsson, P., & Krokhin, A. (2004). Complexity classification in qualitative temporal constraint reasoning. Artificial Intelligence, 160(1-2), 35-51. https://doi.org/10.1016/j.artint.2004.05.010We study the computational complexity of the qualitative algebra which is a temporal constraint formalism that combines the point algebra, the point-interval algebra and Allen's interval algebra. We identify all tractable fragments and show that ever... Read More about Complexity classification in qualitative temporal constraint reasoning.
The computational complexity of the elimination problem in generalized sports competitions (2004)
Journal Article
Kern, W., & Paulusma, D. (2004). The computational complexity of the elimination problem in generalized sports competitions. Discrete Optimization, 1(2), 205-214. https://doi.org/10.1016/j.disopt.2003.12.003Consider a sports competition among various teams playing against each other in pairs (matches) according to a previously determined schedule. At some stage of the competition one may ask whether a particular team still has a (theoretical) chance to... Read More about The computational complexity of the elimination problem in generalized sports competitions.
On the support of recursive subdivision (2004)
Journal Article
Ivrissimtzis, I., Sabin, M., & Dodgson, N. (2004). On the support of recursive subdivision. ACM Transactions on Graphics, 23(4), 1043-1060. https://doi.org/10.1145/1027411.1027417We study the support of subdivision schemes: that is, the region of the subdivision surface, which is affected by the displacement of a single control point. Our main results cover the regular case, where the mesh induces a regular Euclidean tessella... Read More about On the support of recursive subdivision.
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (2004)
Journal Article
Szeider, S. (2004). Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. Journal of Computer and System Sciences, 69(4), 656-674. https://doi.org/10.1016/j.jcss.2004.04.009Recognition of minimal unsatisfiable CNF formulas (unsatisfiable CNF formulas which become satisfiable if any clause is removed) is a classical DP-complete problem. It was shown recently that minimal unsatisfiable formulas with n variables and n+k cl... Read More about Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable.