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.
This paper considers the problem of dimensionality reduction by orthogonal projection techniques. The main feature of the proposed techniques is that they attempt to preserve both the intrinsic neighborhood geometry of the data samples and the global geome ...
New correlations predicting the local boiling heat transfer coefficients for vertical flow over a tube bundle have been developed. These correlations were developed for three different classes of tubes: smooth, low-finned, and Turbo-BII HP. These correlati ...
We consider K-Nearest Neighbor search for high dimensional data in large-scale structured Peer-to-Peer networks. We present an efficient mapping scheme based on p-stable Locality Sensitive Hashing to assign hash buckets to peers in a Chord-style overlay ne ...
This thesis deals with applications of Lie symmetries in differential geometry and dynamical systems. The first chapter of the thesis studies the singular reduction of symmetries of cosphere bundles, the conservation properties of contact systems and their ...
Moire effects that occur in the superposition of aperiodic layers such as correlated random dot screens are known as Glass patterns. One of the most interesting properties of such moire effects, which clearly distinguish them from their periodic counterpar ...
Optical Society of America, Washington, United States2004
This paper addresses the problem of representing multimedia information under a compressed form that permits efficient classification. The semantic coding problem starts from a subspace method where dimensionality reduction is formulated as a matrix factor ...
In recent work of Brock's, the pants graph is shown to be a combinatorial model for the completion of the Weil-Petersson metric on Teichmuller space. We prove that every Farey graph embedded in the pants graph is totally geodesic, in analogy with the extri ...
This paper addresses the problem of 3D face recognition using spherical sparse representations. We first propose a fully automated registration process that permits to align the 3D face point clouds. These point clouds are then represented as signals on th ...
Given a locally uniform sample set P of a smooth surface S. We derive upper and lower bounds on the number k of nearest neighbors of a sample point p that have to be chosen from P such that this neighborhood contains all restricted Delaunay neighbors of p. ...
In this paper, we focus on the use of random projections as a dimensionality reduction tool for sampled manifolds in high-dimensional Euclidean spaces. We show that geodesic paths approximations from nearest neighbors Euclidean distances are well-preserved ...
