<--- Back to Details
First PageDocument Content
Control theory / Discretization / Functional analysis / Numerical analysis / Euler–Lagrange equation / International Obfuscated C Code Contest / Classical cipher / Mathematical analysis / Mathematics / Calculus
Date: 2002-09-12 11:34:56
Control theory
Discretization
Functional analysis
Numerical analysis
Euler–Lagrange equation
International Obfuscated C Code Contest
Classical cipher
Mathematical analysis
Mathematics
Calculus

Mining Time-Changing Data Streams Geoff Hulten Dept. of ComputerScience

Add to Reading List

Source URL: www.cs.uiuc.edu

Download Document from Source Website

File Size: 927,30 KB

Share Document on Facebook

Similar Documents

Logic / Mathematics / Automated theorem proving / Logic programming / Mathematical logic / Logical truth / Propositional calculus / Substitution / Sequence / LOOP / Constructible universe / Ground expression

Extending the Calculus of Looping Sequences to Model Protein Interaction at the Domain Level Roberto Barbuti, Andrea Maggiolo–Schettini, and Paolo Milazzo Dipartimento di Informatica, Universit` a di Pisa

DocID: 1xVZ1 - View Document

Biology / Biochemistry / Logic in computer science / Molecular biology / Epidermal growth factor / Morphogens / Protein domain / Rewriting / Natural computing / RNA polymerase / RNA

The Calculus of Looping Sequences Roberto Barbuti, Giulio Caravagna, Andrea Maggiolo–Schettini, Paolo Milazzo, and Giovanni Pardini Dipartimento di Informatica, Universit` a di Pisa Largo B. Pontecorvo 3, 56127 Pisa, I

DocID: 1xVKh - View Document

Theoretical computer science / Mathematics / Computational complexity theory / Logic in computer science / Automated theorem proving / NP-complete problems / Electronic design automation / Formal methods / Conflict-driven clause learning / Boolean satisfiability problem / Clause / Unit propagation

A Model-Constructing Satisfiability Calculus Leonardo de Moura1 and Dejan Jovanovi´c2 1 2 Microsoft Research

DocID: 1xVCc - View Document

Proof theory / Mathematical logic / Logic / Mathematics / Sequent / Natural deduction / Cut-elimination theorem / Admissible rule / Proof complexity / Propositional calculus / Structural rule / Cut rule

Under consideration for publication in Math. Struct. in Comp. Science Complexity of Translations from Resolution to Sequent Calculus (Presentation-Only - Draft) Giselle Reis1 and Bruno Woltzenlogel Paleo2

DocID: 1xVA3 - View Document

Theoretical computer science / Computational complexity theory / Mathematics / Logic in computer science / Constraint programming / Electronic design automation / Formal methods / NP-complete problems / Boolean satisfiability problem / Conflict-driven clause learning / Satisfiability modulo theories / Unit propagation

The Design and Implementation of the Model Constructing Satisfiability Calculus Dejan Jovanovi´c Clark Barrett

DocID: 1xV9I - View Document