128 search results - page 2 / 26 » Applying IC-Scheduling Theory to Familiar Classes of Computa... |
JC
2008
13 years 7 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
PLSA
1994
13 years 11 months ago
1994
Computer language paradigms offer linguistic abstractions and proof theories for expressing program implementations. Similarly, system architectures offer the hardware abstractions...
CADE
1990
Springer
13 years 11 months ago
1990
Springer
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
GRC
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract--Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns ...
CIE
2005
Springer
14 years 27 days ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...