Sciweavers

759 search results - page 128 / 152
» Structured Learning with Approximate Inference
Sort
View
CIKM
2009
Springer
16 years 14 days ago
Privacy-enhanced public view for social graphs
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...
Hyoungshick Kim, Joseph Bonneau
IMR
2004
Springer
15 years 11 months ago
Identification and Preservation of Surface Features
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...
Timothy J. Baker
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
15 years 11 months ago
Automatic generation of polynomial loop
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...
Enric Rodríguez-Carbonell, Deepak Kapur
NOMS
2002
IEEE
130views Communications» more  NOMS 2002»
15 years 10 months ago
End-to-end service failure diagnosis using belief networks
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...
Malgorzata Steinder, Adarshpal S. Sethi
CORR
2011
Springer
191views Education» more  CORR 2011»
15 years 27 days ago
A Message-Passing Receiver for BICM-OFDM over Unknown Clustered-Sparse Channels
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...
Philip Schniter