2084 search results - page 270 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
SODA
2003
ACM
14 years 11 months ago
2003
ACM
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
AVSS
2006
IEEE
15 years 4 months ago
2006
IEEE
Background modeling for dynamic scenes is an important problem in the context of real time video surveillance systems. Several nonparametric background models have been proposed t...
ALT
2003
Springer
15 years 7 months ago
2003
Springer
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1 . . . α...
105
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
106
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...