Sciweavers

848 search results - page 68 / 170
» Randomness and the linear degrees of computability
Sort
View
CIKM
2009
Springer
15 years 6 months 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
AINA
2010
IEEE
15 years 4 months ago
The Power of Orientation in Symmetry-Breaking
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
Satya Krishna Pindiproli, Kishore Kothapalli
NIPS
2007
15 years 1 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah
BMCBI
2004
153views more  BMCBI 2004»
14 years 11 months ago
Computational protein biomarker prediction: a case study for prostate cancer
Background: Recent technological advances in mass spectrometry pose challenges in computational mathematics and statistics to process the mass spectral data into predictive models...
Michael Wagner, Dayanand N. Naik, Alex Pothen, Sri...
DCC
2005
IEEE
15 years 11 months ago
A Point-Set Compression Heuristic for Fiber-Based Certificates of Authenticity
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
Darko Kirovski