The Experts below are selected from a list of 90 Experts worldwide ranked by ideXlab platform

Izak Broere - One of the best experts on this subject based on the ideXlab platform.

  • Moment Balancing Templates for $(d,k)$ -Constrained Codes and Run-Length Limited Sequences
    IEEE Transactions on Information Theory, 2012
    Co-Authors: Ling Cheng, Hendrik C. Ferreira, Izak Broere
    Abstract:

    The first-order moment of (d, k)-constrained codes is investigated in this paper. A generalized moment balancing template is proposed to encode a (d, k) sequence into a single insertion or deletion correcting codeword without losing the Constraint Property. By relocating 0's in moment balancing runs, which appear in a pairwise manner of a (d, k) sequence, the first-order moment of this sequence can be modified to satisfy the Varshamov-Tenengolts construction. With a reasonably large base in the modulo system introduced by the Varshamov-Tenengolts construction, this generalized moment balancing template can be applied to run-length limited sequences. The asymptotic bound of the redundancy introduced by the template for (d, k) sequences is of the same order as the universal template for random sequences and, therefore, the redundancy is small and suitable for long sequences of practical interest.

  • ISIT - Moment balancing templates for (d, k) constrained codes
    2010 IEEE International Symposium on Information Theory, 2010
    Co-Authors: Ling Cheng, Hendrik C. Ferreira, Izak Broere
    Abstract:

    The first-order moment of (d, k) constrained codes is investigated in this paper. We propose a generalized moment balancing template to encode a (d, k) sequence into a single insertion or deletion correcting codeword without losing the Constraint Property. By relocating 0's in moment balancing runs of a (d, k) sequence, the first-order moment of this sequence can be manipulated to satisfy the Varshamov-Tenengolts construction. The moment balancing runs appear in a pairwise manner in this sequence. The lower bound of the number of balancing bits in the template is asymptotically of the same order as the universal template for random sequences, and is of a practical-interest small.

Ling Cheng - One of the best experts on this subject based on the ideXlab platform.

  • Moment Balancing Templates for $(d,k)$ -Constrained Codes and Run-Length Limited Sequences
    IEEE Transactions on Information Theory, 2012
    Co-Authors: Ling Cheng, Hendrik C. Ferreira, Izak Broere
    Abstract:

    The first-order moment of (d, k)-constrained codes is investigated in this paper. A generalized moment balancing template is proposed to encode a (d, k) sequence into a single insertion or deletion correcting codeword without losing the Constraint Property. By relocating 0's in moment balancing runs, which appear in a pairwise manner of a (d, k) sequence, the first-order moment of this sequence can be modified to satisfy the Varshamov-Tenengolts construction. With a reasonably large base in the modulo system introduced by the Varshamov-Tenengolts construction, this generalized moment balancing template can be applied to run-length limited sequences. The asymptotic bound of the redundancy introduced by the template for (d, k) sequences is of the same order as the universal template for random sequences and, therefore, the redundancy is small and suitable for long sequences of practical interest.

  • ISIT - Moment balancing templates for (d, k) constrained codes
    2010 IEEE International Symposium on Information Theory, 2010
    Co-Authors: Ling Cheng, Hendrik C. Ferreira, Izak Broere
    Abstract:

    The first-order moment of (d, k) constrained codes is investigated in this paper. We propose a generalized moment balancing template to encode a (d, k) sequence into a single insertion or deletion correcting codeword without losing the Constraint Property. By relocating 0's in moment balancing runs of a (d, k) sequence, the first-order moment of this sequence can be manipulated to satisfy the Varshamov-Tenengolts construction. The moment balancing runs appear in a pairwise manner in this sequence. The lower bound of the number of balancing bits in the template is asymptotically of the same order as the universal template for random sequences, and is of a practical-interest small.

Jean-françois Condotta - One of the best experts on this subject based on the ideXlab platform.

  • Studying the use and effect of graph decomposition in qualitative spatial and temporal reasoning
    Knowledge Engineering Review, 2016
    Co-Authors: Michael Sioutis, Yakoub Salhi, Jean-françois Condotta
    Abstract:

    We survey the use and effect of decomposition-based techniques in qualitative spatial and temporal Constraint-based reasoning, and clarify the notions of a tree decomposition, a chordal graph, and a partitioning graph, and their implication with a particular Constraint Property that has been extensively used in the literature, namely, patchwork. As a consequence, we prove that a recently proposed decomposition-based approach that was presented in the study by Nikolaou and Koubarakis for checking the satisfiability of qualitative spatial Constraint networks lacks soundness. Therefore, the approach becomes quite controversial as it does not seem to offer any technical advance at all, while results of an experimental evaluation of it in a following work presented in the study by Sioutis become questionable. Finally, we present a particular tree decomposition that is based on the biconnected components of the Constraint graph of a given large network, and show that it allows for cost-free utilization of parallelism for a qualitative Constraint language that has patchwork for satisfiable atomic networks.

  • SAC - On the use and effect of graph decomposition in qualitative spatial and temporal reasoning
    Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015
    Co-Authors: Michael Sioutis, Yakoub Salhi, Jean-françois Condotta
    Abstract:

    We survey the use and effect of decomposition-based techniques in qualitative Constraint-based reasoning, and clarify the notions of a tree decomposition, a chordal graph, and a partitioning graph, and their implication with a particular Constraint Property that has been extensively used in literature, namely, patchwork. As a consequence, we prove that a recently proposed decomposition-based approach that was presented in [AAAI, 2014 ] for checking the satisfiability of qualitative spatial Constraint networks lacks soundness. Therefore, the approach becomes quite controversial as it does not seem to offer any technical advance at all, while experimental evaluation of it in a following paper presented in [ICTAI, 2014 ] becomes questionable.

  • FLAIRS Conference - A Simple Decomposition Scheme for Large Real World Qualitative Constraint Networks.
    2015
    Co-Authors: Michael Sioutis, Yakoub Salhi, Jean-françois Condotta
    Abstract:

    We improve the state-of-the-art in checking the satisfiability of large real world qualitative Constraint networks (QCNs), by exploiting the loosely connected structure of their underlying graphs. We propose a simple decomposition scheme that retrieves the smaller QCNs that correspond to the biconnected component subgraphs of the underlying graph of a given large QCN, and show that our approach is sound for a qualitative Constraint language that has a particular Constraint Property for atomic QCNs, namely, patchwork. Experimental evaluation shows that state-of-the-art reasoners can significanlty benefit from adopting this approach.

Hendrik C. Ferreira - One of the best experts on this subject based on the ideXlab platform.

  • Moment Balancing Templates for $(d,k)$ -Constrained Codes and Run-Length Limited Sequences
    IEEE Transactions on Information Theory, 2012
    Co-Authors: Ling Cheng, Hendrik C. Ferreira, Izak Broere
    Abstract:

    The first-order moment of (d, k)-constrained codes is investigated in this paper. A generalized moment balancing template is proposed to encode a (d, k) sequence into a single insertion or deletion correcting codeword without losing the Constraint Property. By relocating 0's in moment balancing runs, which appear in a pairwise manner of a (d, k) sequence, the first-order moment of this sequence can be modified to satisfy the Varshamov-Tenengolts construction. With a reasonably large base in the modulo system introduced by the Varshamov-Tenengolts construction, this generalized moment balancing template can be applied to run-length limited sequences. The asymptotic bound of the redundancy introduced by the template for (d, k) sequences is of the same order as the universal template for random sequences and, therefore, the redundancy is small and suitable for long sequences of practical interest.

  • ISIT - Moment balancing templates for (d, k) constrained codes
    2010 IEEE International Symposium on Information Theory, 2010
    Co-Authors: Ling Cheng, Hendrik C. Ferreira, Izak Broere
    Abstract:

    The first-order moment of (d, k) constrained codes is investigated in this paper. We propose a generalized moment balancing template to encode a (d, k) sequence into a single insertion or deletion correcting codeword without losing the Constraint Property. By relocating 0's in moment balancing runs of a (d, k) sequence, the first-order moment of this sequence can be manipulated to satisfy the Varshamov-Tenengolts construction. The moment balancing runs appear in a pairwise manner in this sequence. The lower bound of the number of balancing bits in the template is asymptotically of the same order as the universal template for random sequences, and is of a practical-interest small.

Michael Sioutis - One of the best experts on this subject based on the ideXlab platform.

  • Studying the use and effect of graph decomposition in qualitative spatial and temporal reasoning
    Knowledge Engineering Review, 2016
    Co-Authors: Michael Sioutis, Yakoub Salhi, Jean-françois Condotta
    Abstract:

    We survey the use and effect of decomposition-based techniques in qualitative spatial and temporal Constraint-based reasoning, and clarify the notions of a tree decomposition, a chordal graph, and a partitioning graph, and their implication with a particular Constraint Property that has been extensively used in the literature, namely, patchwork. As a consequence, we prove that a recently proposed decomposition-based approach that was presented in the study by Nikolaou and Koubarakis for checking the satisfiability of qualitative spatial Constraint networks lacks soundness. Therefore, the approach becomes quite controversial as it does not seem to offer any technical advance at all, while results of an experimental evaluation of it in a following work presented in the study by Sioutis become questionable. Finally, we present a particular tree decomposition that is based on the biconnected components of the Constraint graph of a given large network, and show that it allows for cost-free utilization of parallelism for a qualitative Constraint language that has patchwork for satisfiable atomic networks.

  • SAC - On the use and effect of graph decomposition in qualitative spatial and temporal reasoning
    Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015
    Co-Authors: Michael Sioutis, Yakoub Salhi, Jean-françois Condotta
    Abstract:

    We survey the use and effect of decomposition-based techniques in qualitative Constraint-based reasoning, and clarify the notions of a tree decomposition, a chordal graph, and a partitioning graph, and their implication with a particular Constraint Property that has been extensively used in literature, namely, patchwork. As a consequence, we prove that a recently proposed decomposition-based approach that was presented in [AAAI, 2014 ] for checking the satisfiability of qualitative spatial Constraint networks lacks soundness. Therefore, the approach becomes quite controversial as it does not seem to offer any technical advance at all, while experimental evaluation of it in a following paper presented in [ICTAI, 2014 ] becomes questionable.

  • FLAIRS Conference - A Simple Decomposition Scheme for Large Real World Qualitative Constraint Networks.
    2015
    Co-Authors: Michael Sioutis, Yakoub Salhi, Jean-françois Condotta
    Abstract:

    We improve the state-of-the-art in checking the satisfiability of large real world qualitative Constraint networks (QCNs), by exploiting the loosely connected structure of their underlying graphs. We propose a simple decomposition scheme that retrieves the smaller QCNs that correspond to the biconnected component subgraphs of the underlying graph of a given large QCN, and show that our approach is sound for a qualitative Constraint language that has a particular Constraint Property for atomic QCNs, namely, patchwork. Experimental evaluation shows that state-of-the-art reasoners can significanlty benefit from adopting this approach.