412 search results - page 56 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
STOC
2004
ACM
16 years 2 days ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
JAR
2000
14 years 11 months ago
2000
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
191
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
We are interested in capturing time series generated by small wireless electronic sensors. Battery-operated sensors must avoid heavy use of their wireless radio which is a key cau...
NIPS
2008
15 years 1 months ago
2008
We investigate a topic at the interface of machine learning and cognitive science. Human active learning, where learners can actively query the world for information, is contraste...
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...