Sciweavers

5350 search results - page 195 / 1070
» Space and time in eco-ontologies
Sort
View
CSDA
2008
98views more  CSDA 2008»
15 years 6 months ago
Forecasting binary longitudinal data by a functional PC-ARIMA model
The purpose of this paper is to forecast the time evolution of a binary response variable from an associated continuous time series observed only at discrete time points that usual...
Ana M. Aguilera, Manuel Escabias, Mariano J. Valde...
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
13 years 9 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
SPAA
2010
ACM
15 years 11 months ago
Brief announcement: serial-parallel reciprocity in dynamic multithreaded languages
In dynamically multithreaded platforms that employ work stealing, there appears to be a fundamental tradeoff between providing provably good time and space bounds and supporting S...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha
ICALP
1994
Springer
15 years 10 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
ENTCS
2008
68views more  ENTCS 2008»
15 years 6 months ago
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
This paper introduces a new algorithm dedicated to the rigorous reachability analysis of nonlinear dynamical systems. The algorithm is initially presented in the context of discre...
Pieter Collins, Alexandre Goldsztejn