Sciweavers

105 search results - page 21 / 21
» Proving optimizations correct using parameterized program eq...
Sort
View
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 5 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
ICALP
2009
Springer
14 years 5 months ago
Sorting and Selection with Imprecise Comparisons
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
Avinatan Hassidim, Jelani Nelson, Miklós Aj...
ICDCS
2007
IEEE
13 years 11 months ago
Stabilizing Peer-to-Peer Spatial Filters
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
Silvia Bianchi, Ajoy Kumar Datta, Pascal Felber, M...
CCS
2011
ACM
12 years 4 months ago
Policy auditing over incomplete logs: theory, implementation and applications
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
Deepak Garg, Limin Jia, Anupam Datta
BMCBI
2006
122views more  BMCBI 2006»
13 years 4 months ago
PET-Tool: a software suite for comprehensive processing and managing of Paired-End diTag (PET) sequence data
Background: We recently developed the Paired End diTag (PET) strategy for efficient characterization of mammalian transcriptomes and genomes. The paired end nature of short PET se...
Kuo Ping Chiu, Chee-Hong Wong, Qiongyu Chen, Prami...