Sciweavers

608 search results - page 86 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
CISS
2008
IEEE
14 years 2 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman
SAT
2007
Springer
107views Hardware» more  SAT 2007»
14 years 1 months ago
Combining Adaptive Noise and Look-Ahead in Local Search for SAT
Abstract. The adaptive noise mechanism was introduced in Novelty+ to automatically adapt noise settings during the search [4]. The local search algorithm G2 WSAT deterministically ...
Chu Min Li, Wanxia Wei, Harry Zhang
SPAA
2010
ACM
14 years 15 days ago
Collaborative scoring with dishonest participants
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti R...
CCS
2010
ACM
13 years 6 months ago
Designs to account for trust in social network-based sybil defenses
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
Abedelaziz Mohaisen, Nicholas Hopper, Yongdae Kim
ISBI
2002
IEEE
14 years 8 months ago
Correction for external LOR effects in listmode reconstruction for PET
In PET imaging listmode is an alternative for projections to store the acquisition data with more accuracy. The reconstruction starting from the listmode format requires different...
Stefaan Vandenberghe, Yves D'Asseler, Rik Van de W...