2084 search results - page 334 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
AAAI
2010
14 years 11 months ago
2010
In a previous paper, Liu argued for the importance of establishing a precise theoretical foundation for program debugging from first principles. In this paper, we present a first ...
106
click to vote
JMLR
2012
13 years 7 days 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...
STOC
1993
ACM
15 years 1 months ago
1993
ACM
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
COMGEO
2012
ACM
13 years 5 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
CSB
2003
IEEE
15 years 3 months ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...