Outputs (79)

Constant-Rank Codes and Their Connection to Constant-Dimension Codes (2010)
Journal Article
Gadouleau, M., & Yan, Z. (2010). Constant-Rank Codes and Their Connection to Constant-Dimension Codes. IEEE Transactions on Information Theory, 56(7), 3207-3216. https://doi.org/10.1109/tit.2010.2048447

Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random linear network coding. What the maximal cardinality of any constant-dimension code with finite dimension and minimum distance i... Read More about Constant-Rank Codes and Their Connection to Constant-Dimension Codes.

An Adaptive Course Generation Framework (2010)
Journal Article
Li, F., Lau, R., & Dharmendran, P. (2010). An Adaptive Course Generation Framework. International Journal of Distance Education Technologies, 8(3), 74-85. https://doi.org/10.4018/jdet.2010070104

Existing adaptive e-learning methods are supported by student (user) profiling for capturing student characteristics, and course structuring for organizing learning materials according to topics and levels of difficulties. Adaptive courses are then g... Read More about An Adaptive Course Generation Framework.

Performance evaluation of split transmission in multihop wireless networks (2010)
Journal Article
Tu, W., Grout, V., & Excell, P. (2011). Performance evaluation of split transmission in multihop wireless networks. Multimedia Tools and Applications, 54(3), 589-607. https://doi.org/10.1007/s11042-010-0559-2

Multimedia applications in multihop wireless networks have great market potential. Multiple channels and multiple radios are commonly used for exploring multimedia transmissions in multihop wireless networks. Split transmission allows multiple channe... Read More about Performance evaluation of split transmission in multihop wireless networks.

Polygonal mesh watermarking using Laplacian coordinates (2010)
Journal Article
Yang, Y., & Ivrissimtzis, I. (2010). Polygonal mesh watermarking using Laplacian coordinates. Computer Graphics Forum, 29(5), 1585-1593. https://doi.org/10.1111/j.1467-8659.2010.01767.x

We propose a watermarking algorithm for polygonal meshes based on the modification of the Laplacian coordinates. More specifically, we first compute the Laplacian coordinates (x; y; z) of the mesh vertices, then construct the histogram of the lengths... Read More about Polygonal mesh watermarking using Laplacian coordinates.

Placing regenerators in optical networks to satisfy multiple sets of requests (2010)
Presentation / Conference Contribution
Mertzios, G., Sau, I., Shalom, M., & Zaks, S. (2010, July). Placing regenerators in optical networks to satisfy multiple sets of requests. Presented at 37th International Colloquium on Automata, Languages and Programming (ICALP), Bordeaux, France

The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, regenerators must be placed in such a way that in any lightpath there ar... Read More about Placing regenerators in optical networks to satisfy multiple sets of requests.

The PDE framework Peano applied to fluid dynamics: an efficient implementation of a parallel multiscale fluid dynamics solver on octree-like adaptive Cartesian grids (2010)
Journal Article
Bungartz, H., Mehl, M., Neckel, T., & Weinzierl, T. (2010). The PDE framework Peano applied to fluid dynamics: an efficient implementation of a parallel multiscale fluid dynamics solver on octree-like adaptive Cartesian grids. Computational Mechanics, 46(1), 103-114

An Efficient Parallel Implementation of the MSPAI Preconditioner (2010)
Journal Article
Huckle, T., Kallischko, A., Roy, A., Sedlacek, M., & Weinzierl, T. (2010). An Efficient Parallel Implementation of the MSPAI Preconditioner

Window-games between TCP flows (2010)
Journal Article
Efraimidis, P., Tsavlidis, L., & Mertzios, G. (2010). Window-games between TCP flows. Theoretical Computer Science, 411(31-33), 2798-2817. https://doi.org/10.1016/j.tcs.2010.03.031

We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. Analytical and experimental results show the relevance of the Window-game... Read More about Window-games between TCP flows.

Obtaining online ecological colourings by generalizing first-fit (2010)
Presentation / Conference Contribution
Johnson, M., Patel, V., Paulusma, D., & Trunck, T. (2010, December). Obtaining online ecological colourings by generalizing first-fit. Presented at 5th International Computer Science Symposium in Russia (CSR 2010), Kazan, Russia

A colouring of a graph is ecological if every pair of vertices that have the same set of colours in their neighbourhood are coloured alike. We consider the following problem: if a graph G and an ecological colouring c of G are given, can further vert... Read More about Obtaining online ecological colourings by generalizing first-fit.

Frameworks for logically classifying polynomial-time optimisation problems (2010)
Presentation / Conference Contribution
Gate, J., & Stewart., I. (2010, June). Frameworks for logically classifying polynomial-time optimisation problems. Presented at 5th International Computer Science Symposium in Russia (CSR 2010), Kazan, Russia

We show that a logical framework, based around a fragment of existential second-order logic formerly proposed by others so as to capture the class of polynomially-bounded P-optimisation problems, cannot hope to do so, under the assumption that P ≠ NP... Read More about Frameworks for logically classifying polynomial-time optimisation problems.