An Evaluation of Stratified Sampling of Microarchitecture Simulations
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
As the World Wide Web is growing rapidly, it is getting increasingly challenging to gather representative information about it. Instead of crawling the web exhaustively one has to resort to other techniques like sampling to determine the properties of the ...
The accurate and efficient sampling of scattering parameters is addressed. A popular sampling technique is the uniform sampling combined with a straight-line interpolation for representing the continuous variation of the observable. However, this sampling ...
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nodes to a random subset of them. In a recent work [Eisenbrand,Grandoni,Rothvo\ ...
A quadrature sub-sampling direct conversion mixer capable of sampling two or more bands concurrently using a single sampling frequency is presented. The implementation of the mixer to sample a band in quadrature and downconvert it to baseband is discussed ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
This communication addresses the problem of any simulation tool: the accurate and efficient sampling of a physical observable with respect to a parameter. A popular sampling technique is the uniform sampling combined with a straight-line interpolation for ...
We study the problem of learning ridge functions of the form f(x) = g(aT x), x ∈ ℝd, from random samples. Assuming g to be a twice continuously differentiable function, we leverage techniques from low rank matrix recovery literature to derive a uniform app ...
Given a set P of n points in R-d and epsilon > 0, we consider the problem of constructing weak E-nets for P. We show the following: pick a random sample Q of size O(1/epsilon log(1/epsilon)) from P. Then, with constant probability, a weak epsilon-net of P ...
We study the distributed sampling and centralized reconstruction of two correlated signals, modeled as the input and output of an unknown sparse filtering operation. This is akin to a Slepian-Wolf setup, but in the sampling rather than the lossless compres ...
This paper presents a new paradigm for choice set generation in the context of route choice model estimation. We assume that the choice sets contain all paths connecting each origin-destination pair. Although this is behaviorally questionable, we make this ...
Mutual information is a widely used similarity measure for aligning multimodal medical images. At its core it relies on the computation of a discrete joint histogram, which itself requires image samples for its estimation. In this paper we study the influe ...
