نتایج جستجو برای: lightweight

تعداد نتایج: 21156  

1998
Patrick McDaniel Peter Honeyman Atul Prakash

An advantage of today’s high speed networks is the ability to support group communication. Applications that support group communication allow the free exchange of ideas and data in real time, regardless of the physical distance between the participants. Unfortunately, support for additional protocol features such as reliability, secrecy, and total ordering in the multicast context requires mor...

2003
Sylvain Paris François X. Sillion Long Quan

In this paper we present a method to relight human faces in real time, using consumer-grade graphics cards even with limited 3D capabilities. We show how to render faces using a combination of a simple, hardware-accelerated parametric model simulating skin shading and a detail texture map, and provide robust procedures to estimate all the necessary parameters for a given face. Our model strikes...

2005
Atsushi Igarashi Chieri Saito Mirko Viroli

Family polymorphism has been proposed for object-oriented languages as a solution to supporting reusable yet type-safe mutually recursive classes. A key idea of family polymorphism is the notion of families, which are used to group mutually recursive classes. In the original proposal, due to the design decision that families are represented by objects, dependent types had to be introduced, resu...

2015
Sam Lindley J. Garrett Morris

Row types provide an account of extensibility that combines well with parametric polymorphism and type inference. We discuss the integration of row types and session types in a concurrent functional programming language, and how row types can be used to describe extensibility in session-typed communication.

2000
Sholom M. Weiss Nitin Indurkhya

A lightweight rule induction method is described that generates compact Disjunctive Normal Form (DNF) rules. Each class has an equal number of unweighted rules. A new example is classi ed by applying all rules and assigning the example to the class with the most satis ed rules. The induction method attempts to minimize the training error with no pruning. An overall design is speci ed by setting...

2013
Ioana Boureanu Aikaterini Mitrokotsa Serge Vaudenay

Distance-bounding is a practical solution aiming to prevent relay attacks. The main challenge when designing such protocols is maintaining their inexpensive cryptographic nature, whilst being able to protect against as many, if not all, of the classical threats posed in their context. Moreover, in distancebounding, some subtle security shortcomings related to the PRF (pseudorandom function) ass...

Journal: :CoRR 2017
Altaf H. Khan

Most of the weights in a Lightweight Neural Network have a value of zero, while the remaining ones are either +1 or −1. These universal approximators require approximately 1.1 bits/weight of storage, posses a quick forward pass and achieve classification accuracies similar to conventional continuous-weight networks. Their training regimen focuses on error reduction initially, but later emphasiz...

2012
Daniel Borkmann Wolfgang Mühlbauer Dietmar Reimann

During the last decades the Internet architecture matured and gained more and more popularity. Networking devices of all kind ranging from high-end servers to personal computers, tablet devices, mobile phones or even embedded sensor networks make use of it. The Internet became ubiquitous for us. Even though we witness such a diversity of devices, the progress of having an efficient interconnect...

Journal: :JSEA 2010
Zheying Zhang Mike Arvela Eleni Berki Matias Muhonen Jyrki Nummenmaa Timo Poranen

Most requirements management processes and associated tools are designed for document-driven software development and are unlikely to be adopted for the needs of an agile software development team. We discuss how and what can make the traditional requirements documentation a lightweight process, and suitable for user requirements elicitation and analysis. We propose a reference model for requir...

Journal: :IACR Cryptology ePrint Archive 2015
Siang Meng Sim Khoongming Khoo Frédérique E. Oggier Thomas Peyrin

In this article, we provide new methods to look for lightweight MDS matrices, and in particular involutory ones. By proving many new properties and equivalence classes for various MDS matrices constructions such as circulant, Hadamard, Cauchy and Hadamard-Cauchy, we exhibit new search algorithms that greatly reduce the search space and make lightweight MDS matrices of rather high dimension poss...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید