148 search results - page 21 / 30 » Formally Analyzing Expected Time Complexity of Algorithms Us... |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
FMCO
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We describe the algorithmic and implementation ideas behind a tool, Orion, for finding common programming errors in C and C++ programs using static code analysis. We aim...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
SIMPRA
2008
13 years 7 months ago
2008
: DEVS is a Modeling and Simulation formalism that has been widely used to study the dynamics of discrete event systems. Cell-DEVS is a DEVS-based formalism that defines spatial mo...
JMLR
2012
11 years 10 months ago
2012
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...