We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
A surface is often approximated by a network of triangular facets. In the absence of a precise mathematical description of the underlying surface all information about surface pro...
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
We propose a factor-graph-based approach to joint channel-estimationand-decoding of bit-interleaved coded orthogonal frequency division multiplexing (BICM-OFDM). In contrast to ex...