6105 search results - page 49 / 1221 » A Parallel Algorithm for Bound-Smoothing |
138
click to vote
SAC
2011
ACM
14 years 17 days ago
2011
ACM
Slice sampling provides an easily implemented method for constructing a Markov chain Monte Carlo (MCMC) algorithm. However, slice sampling has two major drawbacks: (i) it requires...
114
click to vote
TCS
2010
14 years 8 months ago
2010
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
CACM
2011
14 years 4 months ago
2011
ple abstraction encapsulating the desired interface between programmers and system builders. Using Simple ion to Reinvent Computing for Parallelism doi:10.1145/1866739.1866757 abst...
FGCS
2010
14 years 8 months ago
2010
Bulk Synchronous Parallel ML is a high-level language for programming parallel algorithms. Built upon OCaml and using the BSP model, it provides a safe setting for their implementa...
CONCURRENCY
2002
14 years 9 months ago
2002
Parallel visualization of large datasets in GeoFEM is described. Our visualization subsystem supports concurrent visualization with computation, and outputs a simplified small gra...