Related publications (32)

Efficient randomized generation of optimal algorithms for multiplication in certain finite fields

Mohammad Amin Shokrollahi

Let Nmax(q)N_{max}(q) denote the maximum number of points of an elliptic curve over FqF_q . Given a prime power q=pfq=p^f and an integern satisfying 12q+1<nle(Nmax(q)2)/2\frac{1}{2}q+1 < n le (N_{max}(q)2)/2, we present an algorithm which on inputq andn produces an optimal bilinear ...
1992

A methodology for estimation of travel time statistics on urban network

André-Gilles Dumont, Edward Chung, Ashish Bhaskar

This paper presents a methodology that integrates cumulative plots with probe vehicle data for estimation of travel time statistics (average, quartile) on urban network. The integration reduces the relative deviations amongst the cumulative plots so that t ...
Wiley-Blackwell0

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.