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.
Graph Coloring is a very active field of research in graph theory as well as in the domain of the design of efficient heuristics to solve problems which, due to their computational complexity, cannot be solved exactly (no guarantee that an optimal solution ...
We analyze whether Independant Component Analysis (ICA) is an appropriate tool for estimating spatial information in spatiochromatic mosaiced color images. In previous studies, ICA analysis of natural color scenes (Hoyer et al. 2000; Tailor et al., 2000; W ...
We present a theoretical study of the anisotropy and collection angle dependence of the oxygen K ELNES in V2O5. Ab initio bandstructure calculations were performed with WIEN97, a program package based on the full potential linearised augmented plane waves ...
We consider the problem of partitioning the node set of a graph into p cliques and k stable sets, namely the (p,k)-coloring problem. Results have been obtained for general graphs \cite{hellcomp}, chordal graphs \cite{hellchordal} and cacti for the case whe ...
Autofluorescence (AF) bronchoscopy is a useful tool for early cancer detection. However the mechanisms involved in this diagnosis procedure are poorly understood. We present an in vivo autofluorescence imaging study to access the depth of the principal con ...
The mechanisms by which the brain represents colors are largely unknown. In addition, the large number of color phenomena in the natural world has made understanding color rather difficult. Color transparency perception, which is studied in this thesis, is ...
We consider a multicast configuration with two sources, and translate the network code design problem to vertex coloring of an appropriately defined graph. This observation enables to derive code design algorithms and alphabet size bounds, as well as estab ...
A polynomial time solution algorithm is described to find a smallest subset R of nodes of a directed graph D=(V,A) such that, for every node v in V-R, there are k edge-disjoint paths from R to v and there are l edge-disjoint paths from v to R. ...
Extended X-ray absorption fine structure (EXAFS) above the In K-edge of luminescent InGaN heterostructures provides a unique probe of local structure on an atomic length scale. Through a process of fitting the experimental spectrum, we can refine a model o ...
Parity (matching theory) and connectivity (network flows) are two main branches of combinatorial optimization. In an attempt to understand better their interrelation, we study a problem where both parity and connectivity requirements are imposed. The main ...
