Sciweavers

4800 search results - page 384 / 960
» OO Distributed Programming is Not Distributed OO Programming
Sort
View
126
Voted
TOOLS
2010
IEEE
15 years 1 months ago
Visualizing Dynamic Metrics with Profiling Blueprints
While traditional approaches to code profiling help locate performance bottlenecks, they offer only limited support for removing these bottlenecks. The main reason is the lack of v...
Alexandre Bergel, Romain Robbes, Walter Binder
151
Voted
PPOPP
2012
ACM
13 years 11 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
MICRO
2010
IEEE
153views Hardware» more  MICRO 2010»
15 years 1 months ago
Scalable Speculative Parallelization on Commodity Clusters
While clusters of commodity servers and switches are the most popular form of large-scale parallel computers, many programs are not easily parallelized for execution upon them. In...
Hanjun Kim, Arun Raman, Feng Liu, Jae W. Lee, Davi...
JMLR
2012
13 years 6 months ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski
JMLR
2012
13 years 6 months ago
High-Rank Matrix Completion
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...
Brian Eriksson, Laura Balzano, Robert Nowak