1021 search results - page 32 / 205 » Fast Approximate PCPs |
ENTCS
2006
13 years 9 months ago
2006
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
RECOMB
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. Given the substantial computational requirements of stochastic simulation, approximation is essential for efficient analysis of any realistic biochemical system. This pap...
SIGCOMM
2006
ACM
14 years 2 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
ICPP
2003
IEEE
14 years 2 months ago
2003
IEEE
Pairwise sequence alignment is a fundamental operation for homology search in bioinformatics. For two DNA or protein sequences of length ¢ and £ , full-matrix (FM), dynamic prog...
SSDBM
2000
IEEE
14 years 1 months ago
2000
IEEE
Fast retrieval of time series in terms of their contents is important in many application domains. This paper studies database techniques supporting fast searches for time series ...