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.
Hypersingular 4-D integrals, arising in the Galerkin discretization of surface integral equation formulations, are computed by means of the direct evaluation method. The proposed scheme extends the basic idea of the singularity cancellation methods, usuall ...
Institute of Electrical and Electronics Engineers2011
We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral eigenfunctions th ...
Curves on surfaces play an important role in computer aided geometric design. In this paper, we present a parabola approximation method based on the cubic reparameterization of rational Bezier surfaces, which generates G1 continuous approximate curves lyin ...
Our interest is to characterize the spline-like integer-shift-invariant bases capable of reproducing exponential polynomial curves. We prove that any compact-support function that reproduces a subspace of the exponential polynomials can be expressed as the ...
The direct evaluation method tailored to the 4-D singular integrals over vertex adjacent triangles, arising in the first-kind and second-kind Fredholm surface integral equation formulations, is presented. A combination of singularity cancellation, reorderi ...
Institute of Electrical and Electronics Engineers2011
Despite the large success of games grounded on movement-based interactions the current state of full-body motion capture technologies still prevents the exploitation of precise interactions with complex environments. The first key requirement in the line o ...
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 ...
Dense disparity maps can be computed from wide-baseline stereo pairs but will inevitably contain large areas where the depth cannot be estimated accurately because the pixels are seen in one view only. A traditional approach to this problem is to introduce ...
In this study, we address the problem of computing efficiently a dense optical flow between two images under a total variation (TV) regularization and an L1 norm data fidelity constraint using a variational method. We build upon Nesterov's framework for ...
We study continuity properties of law-invariant (quasi-)convex functions f : L1(Ω,F, P) to ( ∞,∞] over a non-atomic probability space (Ω,F, P) .This is a supplementary note to [12] ...