Concept

Algorithme de multiplication d'entiers

Publications associées (142)

VSH, an efficient and provable collision-resistant hash function

We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of very smooth numbers modulo an S-bit composite. By very smooth, we mean that the smoothnes ...

Springer Verlag2006

A benchmark on the calculation of kinetic parameters based on reactivity effect experiments in the CROCUS reactor

Rakesh Chawla

Measurements in the CROCUS reactor at EPFL, Lausanne, are reported for the critical water level and the inverse reactor period for several different sets of delayed supercritical conditions. The experimental configurations were also calculated by four diff ...

Elsevier2006

Tracking Atoms with Particles

Pierre Vandergheynst, Gianluca Monaci, Emilio Maggio

We present a general framework and an efficient algorithm for tracking relevant video structures. The structures to be tracked are implicitly defined by a Matching Pursuit procedure that extracts and ranks the most important image contours. Based on the ra ...

2006

A unified electrostatic and cavitation model for first-principles molecular dynamics in solution

Nicola Marzari, Matteo Cococcioni, François Gygi

The electrostatic continuum solvent model developed by [Fattebert and Gygi J. Comput. Chem. 23, 662 (2002); Int. J. Quantum Chem. 93, 139 (2003)] is combined with a first-principles formulation of the cavitation energy based on a natural quantum-mechanical ...

2006

Noise-enhanced computation in a model of a cortical column

Wulfram Gerstner, Julien Mayor

Varied sensory systems use noise in order to enhance detection of weak signals. It has been conjectured in the literature that this effect, known as stochastic resonance, may take place in central cognitive processes such as memory retrieval of arithmetica ...

Lippincott, Williams & Wilkins2005

Branch-and-Prune Search Strategies for Numerical Constraint Solving

Boi Faltings, Marius-Calin Silaghi, Xuan-Ha Vu

When solving numerical constraints such as nonlinear equations and inequalities, solvers often exploit pruning techniques, which remove redundant value combinations from the domains of variables, at pruning steps. To find the complete solution set, most of ...

2005

New dynamic programming algorithms for the resource constrained shortest path problem

Matteo Salani

The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. We address the optimization of the RCESPP and we present and compare ...

2005

Matrix Implementations

Spyridon Pongas

The project consists in the study, implementation and comparison of binary matrix multiplication algorithms in C++. We consider Strassen’s algorithm (which is known to perform well over the real numbers) the Four Russians algorithm (which is designed for b ...

2005

Probabilistic modeling of texture transition for fast tracking and delineation

Seyed Ali Shahrokni

In this thesis a probabilistic approach to texture boundary detection for tracking applications is presented. We have developed a novel fast algorithm for Bayesian estimation of texture transition locations from a short sequence of pixels on a scanline tha ...

EPFL2005

Efficient String Matching Algorithms for Combinatorial Universal Denoising

Suhas Diggavi, Sanket Dusad

Inspired by the combinatorial denoising method {\tt DUDE} \cite{WOSVW04}, we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We also propose effective, efficient denoising error estimators ...

2005

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search