Concept

Quantum complexity theory

Related publications (357)

Stochastic Simulations in Systems Biology

With the advances in measurement technology for molecular biology, predictive mathematical models of cellular processes come in reach. A large fraction of such models addresses the kinetics of interaction between biomolecules such as proteins, transcriptio ...

IGI Global2010

Comparison of time and frequency domain interpolation implementations for MB-OFDM UWB transmitters

This paper investigates the effect of time-domain (TD) and frequency-domain (FD) interpolation on the performance of a Multi-Band (MB) Orthogonal Frequency Division Multiplexing (OFDM) Ultra-Wideband (UWB) system. We introduce a FD interpolator implemented ...

2010

A Weighting Scheme for Enhancing Community Detection in Networks

Martin Hasler, Alireza Khadivi

Many algorithms have recently been proposed for finding communities in networks. By definition, a community is a subset of vertices with a high number of connections among the vertices, but only few connections with other vertices. The worst drawback of mo ...

IEEE2010

Robust Duplicate Detection of 2D and 3D Objects

Touradj Ebrahimi, Jong Seok Lee, Lutz Goldmann, Ivan Ivanov, Péter Vajda

In this paper, we analyze our graph-based approach for 2D and 3D object duplicate detection in still images. A graph model is used to represent the 3D spatial information of the object based on the features extracted from training images so that an explici ...

2010

Graph-based classification of multiple observation sets

Pascal Frossard, Effrosyni Kokiopoulou

We consider the problem of classification of multiple observations of the same object, possibly under different transformations. We view this problem as a special case of semi-supervised learning where all unlabelled examples belong to the same unknown cla ...

Elsevier2010

Programmable Triangular Neighborhood Function for Kohonen Self-Organizing Map Implemented on Chip

Rafal Tomasz Dlugosz

A new hardware implementation of the triangular neighborhood function (TF) for ultra-low power, self-organizing maps (SOM) is presented. Simulations carried out in the software model of this network show that even for low signal resolutions (3-6 bits) perf ...

Technical University of Lodz2010

Additive Combinatorics and Discrete Logarithm Based Range Protocols

Rafik Chaabouni, Helger Lipmaa

We show how to express an arbitrary integer interval

I = [0, H]

as a sumset

I = \sum_{i=1}^\ell G_i * [0, u - 1] + [0, H']

of smaller integer intervals for some small values

\ell

u

, and

H' < u - 1

, where

b * A = \{b a : a \in A\}

and $A + B = ...

Springer2010

Fast Interscale Wavelet Denoising of Poisson-Corrupted Images

Michaël Unser, Thierry Blu, Cédric René Jean Vonesch, Florian Luisier

We present a fast algorithm for image restoration in the presence of Poisson noise. Our approach is based on (1) the minimization of an unbiased estimate of the MSE for Poisson noise, (2) a linear parametrization of the denoising process and (3) the preser ...

Elsevier2010

Quantitative Languages

Laurent Doyen

Quantitative generalizations of classical languages, which assign to each word a real number instead of a Boolean value, have applications in modeling resource-constrained computation. We use weighted automata (finite automata with transition weights) to d ...

2010

Refined quorum systems

Rachid Guerraoui, Marko Vukolic

It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform fast if few failures occur, the system is synchronous and there is no contenti ...

2010

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.

Additive Combinatorics and Discrete Logarithm Based Range Protocols

Rafik Chaabouni, Helger Lipmaa

We show how to express an arbitrary integer interval

I = [0, H]

as a sumset

I = \sum_{i=1}^\ell G_i * [0, u - 1] + [0, H']

of smaller integer intervals for some small values

\ell

u

, and

H' < u - 1

, where

b * A = \{b a : a \in A\}

and $A + B = ...

Springer2010