- Wiley Online Library
... exponentially with the number of random dimensions. A more attractive choice, as proposed in [12], is based on sparse grids generated using the Smolyak algorithm [15]. Smolyakâs construction, also referred as sparse grid, hyperbolic cross or Boolean blending, provides a general tool for constructing ...
... exponentially with the number of random dimensions. A more attractive choice, as proposed in [12], is based on sparse grids generated using the Smolyak algorithm [15]. Smolyakâs construction, also referred as sparse grid, hyperbolic cross or Boolean blending, provides a general tool for constructing ...
Multiway Spatial Joins - Department of Computer Science, HKU
... introducing more than one partition layers. Each object is assigned in a single partition, but one partition may be joined with many upper layers. The number of layers is usually small enough for one partition from each layer to fit in memory, thus multiple scans during the join phase are not needed ...
... introducing more than one partition layers. Each object is assigned in a single partition, but one partition may be joined with many upper layers. The number of layers is usually small enough for one partition from each layer to fit in memory, thus multiple scans during the join phase are not needed ...
Automated Theorem Proving in Loop Theory
... loop (definitions to follow in section 2), thus solving one of the oldest open problems in loop theory. The present paper is devoted to automated theorem proving. For model building, it seems that GAP/Loops is far better than general purpose automated reasoning tools, especially in certain of the mo ...
... loop (definitions to follow in section 2), thus solving one of the oldest open problems in loop theory. The present paper is devoted to automated theorem proving. For model building, it seems that GAP/Loops is far better than general purpose automated reasoning tools, especially in certain of the mo ...
View PDF - CiteSeerX
... sent we hope that this refinement is as efficient as if the more strict requirements had been known at the start. In general, we ask whether it is possible to interrupt a transmission at any time without loss of optimality. An example of successive refinement might be image compression in which one ...
... sent we hope that this refinement is as efficient as if the more strict requirements had been known at the start. In general, we ask whether it is possible to interrupt a transmission at any time without loss of optimality. An example of successive refinement might be image compression in which one ...
Data mining of temporal sequences for the prediction of infrequent
... In order to meet the mounting social and economic demands as well as the pressure to stand out within fierce global competitivity, railway operators and manufacturers are striving for a longer availability and a better reliability of railway transportation systems. A permissive and lax maintenance s ...
... In order to meet the mounting social and economic demands as well as the pressure to stand out within fierce global competitivity, railway operators and manufacturers are striving for a longer availability and a better reliability of railway transportation systems. A permissive and lax maintenance s ...
Data mining of temporal sequences for the prediction of infrequent
... In order to meet the mounting social and economic demands as well as the pressure to stand out within fierce global competitivity, railway operators and manufacturers are striving for a longer availability and a better reliability of railway transportation systems. A permissive and lax maintenance s ...
... In order to meet the mounting social and economic demands as well as the pressure to stand out within fierce global competitivity, railway operators and manufacturers are striving for a longer availability and a better reliability of railway transportation systems. A permissive and lax maintenance s ...
Recursion (Ch. 10)
... 'returns n-th Fibonacci number' if n < 2: # base case return 1 # recursive step return rfib(n-1) + rfib(n-2) ...
... 'returns n-th Fibonacci number' if n < 2: # base case return 1 # recursive step return rfib(n-1) + rfib(n-2) ...
Theoretical computer science
Theoretical computer science is a division or subset of general computer science and mathematics that focuses on more abstract or mathematical aspects of computing and includes the theory of computation.It is not easy to circumscribe the theory areas precisely and the ACM's Special Interest Group on Algorithms and Computation Theory (SIGACT) describes its mission as the promotion of theoretical computer science and notes:Template:""To this list, the ACM's journal Transactions on Computation Theory adds coding theory, computational learning theory and theoretical computer science aspects of areas such as databases, information retrieval, economic models and networks. Despite this broad scope, the ""theory people"" in computer science self-identify as different from the ""applied people."" Some characterize themselves as doing the ""(more fundamental) 'science(s)' underlying the field of computing."" Other ""theory-applied people"" suggest that it is impossible to separate theory and application. This means that the so-called ""theory people"" regularly use experimental science(s) done in less-theoretical areas such as software system research. It also means that there is more cooperation than mutually exclusive competition between theory and application.