Concept

Giffen good

Related publications (36)

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.

Dynamic Region and Block-Based Motion Estimation for Video Compression

Pierre Vandergheynst, Philippe Jost

The aim of this project is to find a motion estimation method that works in combination with block matching in order to reduce the visible artifacts. The proposed solution tries to extract the real motions taking place in a sequence. The developed algorith ...

2002

A study of built-in filter for some eddy-viscosity models in large-eddy simulation

Michel Deville

Traditional large-eddy simulation (LES) provides good results on standard benchmark turbulent flows, but engineering applications involving more complex geometries are restricted. This is mainly due to the physical hypotheses of homogeneity, isotropy, or l ...

2001

Quantitative Rietveld phase analysis of calcium aluminate cements

Karen Scrivener

Rietveld analysis is a powerful technique for obtaining quantitative data on the relative amounts of phases in a mixture of phases, such as cement. However, a good knowledge of crystallography and the development of a refinement strategy with synthetic pha ...

1999

Chaos shift keying in the presence of noise: a simple discrete time example

Martin Hasler

The transmission of binary information using chaotic switching, also called chaos shift keying is used. On the receiver side the information is extracted using a method that is not based on synchronization, but that directly tries to detect which chaotic s ...

1998

A Path Selection Method in ATM using Pre-Computation

Jean-Yves Le Boudec, Olivier Crochat

An algorithm that pre-computes a list of routes for each node in the network. An alternate route is also computed in case of overload of the primary one. Simulations show that this algorithm provides routes as good as On-Demand ones. ...

1996

Restructuring Symbolic Programs for Concurrent Execution on Multiprocessors

James Richard Larus

CURARE, the program restructurer described in this dissertation, automatically transforms a sequential Lisp program into an equivalent concurrent program that executes on a multiprocessor. CURARE first analyzes a program to find its control and data depend ...

Computer Science Division (EECS), University of California at Berkeley1989