Cracking The Complexity Of Fixed-Point Refinement In Complex Wireless Systems
Related publications (40)
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.
We consider the problem of broadcasting in an ad-hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless netwo ...
A method that exploits an information theoretic framework to extract optimized audio features using video information is presented. A simple measure of mutual information (MI) between the resulting audio and video features allows the detection of the activ ...
Continuous queries over data streams typically produce large volumes of result streams. To scale up the system, one should carefully study the problem of delivering the result streams to the end users, which, unfortunately, is often over-looked in existing ...
Self limiting epidemic forwarding is a method of epidemic information dissemination in wireless ad-hoc networks that achieves congestion control by limiting spread (i.e. the number of nodes that receive a given message) and injection rate in order to prese ...
Tyrosinase is a type I membrane protein found in melanosomes, which are lysosomal-like organelles and specific for pigment cells. A mutation of mouse tyrosinase, platinum (cp), leads to truncation of tyrosinase's cytosolic tail, and results in misrouting t ...
This paper proposes a new modular multiplication method that uses Montgomery residues defined by a modulus M and a Montgomery radix R whose value is less than the modulus M. This condition enables the operand multiplier to be split into two parts that can ...
An efficient algorithm for band connectivity (BC) resoln. is presented. The method uses only readily available band coeffs. and the overlap matrix, and has a low computational cost. The accuracy of the BC resoln. is such that the method is practical for me ...
Just about every other technical publication you pick up these days makes sweeping statements concerning the pressures on scientists, engineers, and industries as a whole to get to market in less time, with an improved, less expensive product. I am reminde ...
We use cryo-electron microscopy to compare 3D shapes of 158 bp long DNA minicircles that differ only in the sequence within an 18 bp block containing either a TATA box or a catabolite activator protein binding site. We present a sorting algorithm that corr ...