Sciweavers

200 search results - page 38 / 40
» A Core Calculus for Provenance
Sort
View
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 7 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
POPL
2010
ACM
14 years 2 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
14 years 1 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
LCTRTS
2007
Springer
14 years 1 months ago
Combining source-to-source transformations and processor instruction set extensions for the automated design-space exploration o
Industry’s demand for flexible embedded solutions providing high performance and short time-to-market has led to the development of configurable and extensible processors. The...
Richard Vincent Bennett, Alastair Colin Murray, Bj...