Publication

Calibration of Spectral Reaction Data

Related publications (81)

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.

Lindane and Technical HCH Residues in Indian Soils and Sediments: A Critical Appraisal

Jean-Paul Schwitzguebel, Sylvie Vullioud-Marcacci

Even at low residue concentrations, persistent organic pollutants (POPs) are of increasing concern all over the world. They include numerous organochlorine pesticides, like hexachlorocyclohexane (HCH), known for its toxicity, lipophilic properties and very ...

2004

Secure Positioning in Sensor Networks

Jean-Pierre Hubaux, Srdan Capkun

So far, the problem of positioning in sensor and ad hoc networks has been studied in a non-adversarial setting. We show that most of the proposed positioning algorithms are highly vulnerable to attacks from compromised network nodes and malicious (outside) ...

2004

Modeling Human Interaction in Meetings

Hervé Bourlard, Daniel Gatica-Perez, Samy Bengio, Guillaume Lathoud, Darren Moore, Florent Monay Michaud

This paper investigates the recognition of group actions in meetings by modeling the joint behaviour of participants. Many meeting actions, such as presentations, discussions and consensus, are characterised by similar or complementary behaviour across par ...

2003

Modeling Human Interaction in Meetings

Hervé Bourlard, Daniel Gatica-Perez, Samy Bengio, Guillaume Lathoud, Darren Moore, Florent Monay Michaud

IDIAP2002

Modeling human bodies from video sequences

Daniel Thalmann, Pascal Fua, Ralf Plänkers

In this paper, we show that, given video sequences of a moving person acquired with a multi-camera system, we can track joint locations during the movement and recover shape information. We outline techniques for fitting a simplified model to the noisy 3-D ...

SPIE-Int. Soc. Opt. Eng1998

Sufficient conditions for the existence of Q-balls in gauge theories

1998

On the Decomposition of Polychotomies into Dichotomies

Many important classification problems are emphpolychotomies, emphi.e. the data are organized into

K

classes with

K>2

. Given an unknown function

F : Omega to {1, dots, K}

representing a polychotomy, an algorithm aimed at ``learning'' this polychotomy ...

Morgan Kaufmann1997

On the Decomposition of Polychotomies into Dichotomies

Many important classification problems are \emph{polychotomies}, \emph{i.e.} the data are organized into

K

classes with

K>2

. Given an unknown function

F : Ømega \to \{1, \dots, K\}

representing a polychotomy, an algorithm aimed at ``learning'' this p ...

IDIAP1996

Experimental Investigation of a Hermetic Scroll Expander–Generator.

Daniel Favrat

This paper describes a 1 to 3.5 kWe hermetic scroll expander generator modified from a standard hermetic compressor, an organic Rankine cycle test facility built to test expanders up to 10 kWe and a set of experimental results using HFC 134a in the dry vap ...

1994

Birefringence characterization of fibres without polarizer

Luc Thévenaz

Two new simple interferometric methods for birefringence measurements are described applying to either low- or high-birefringence fibres and to any kind of birefringence, the set-up being free of a polarizing device. ...

Consulting Committee Professional Electroeng. Organ. Finland1987

On the Decomposition of Polychotomies into Dichotomies

Many important classification problems are \emph{polychotomies}, \emph{i.e.} the data are organized into

K

classes with

K>2

. Given an unknown function

F : Ømega \to \{1, \dots, K\}

representing a polychotomy, an algorithm aimed at ``learning'' this p ...

IDIAP1996

On the Decomposition of Polychotomies into Dichotomies

Many important classification problems are emphpolychotomies, emphi.e. the data are organized into

K

classes with

K>2

. Given an unknown function

F : Omega to {1, dots, K}

representing a polychotomy, an algorithm aimed at ``learning'' this polychotomy ...

Morgan Kaufmann1997