3096 search results - page 102 / 620 » The Generalized FITC Approximation |
APAL
2006
13 years 9 months ago
2006
We give a short proof of a lemma which generalizes both the main lemma from the original construction in the author's thesis of a model with no 2-Aronszajn trees, and also th...
APPML
2006
13 years 9 months ago
2006
We introduce new boundary conditions for Large Eddy Simulation. These boundary conditions are based on an approximate deconvolution approach. They are computationally efficient an...
POPL
2007
ACM
14 years 9 months ago
2007
ACM
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
SBCCI
2009
ACM
14 years 3 months ago
2009
ACM
The purpose of this work is the proposal of a 10-Bit / 1 MSPS Analog to Digital Converter (ADC) with error correction to match the requirements of a CMOS wavefront sensor for opht...
APPROX
2000
Springer
14 years 1 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...