Sciweavers

492 search results - page 4 / 99
» Simplifying Probabilistic Programs Using Computer Algebra
Sort
View
187
Voted
OSDI
2004
ACM
16 years 5 months ago
MapReduce: Simplified Data Processing on Large Clusters
MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to ge...
Jeffrey Dean, Sanjay Ghemawat
158
Voted
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
15 years 11 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
155
Voted
ARTS
1999
Springer
15 years 9 months ago
Process Algebra with Probabilistic Choice
Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this probl...
Suzana Andova
159
Voted
SPAA
2010
ACM
15 years 10 months ago
Simplifying concurrent algorithms by exploiting hardware transactional memory
We explore the potential of hardware transactional memory (HTM) to improve concurrent algorithms. We illustrate a number of use cases in which HTM enables significantly simpler c...
Dave Dice, Yossi Lev, Virendra J. Marathe, Mark Mo...
PARLE
1993
15 years 9 months ago
A Parallel Programming Style and Its Algebra of Programs
Abstract. We present a set of primitive program schemes, which together with just two basic combining forms provide a suprisingly expressive parallel programming language. The prim...
Chris Hankin, Daniel Le Métayer, David Sand...