نتایج جستجو برای: on average

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

Journal: :Signal Processing Systems 2013
Maurizio Martina Guido Masera

In this work novel results concerning Network-onChip-based turbo decoder architectures are presented. Stemming from previous publications, this work concentrates first on improving the throughput by exploiting adaptive-bandwidthreduction techniques. This technique shows in the best case an improvement of more than 60 Mb/s. Moreover, it is known that double-binary turbo decoders require higher a...

2017
Raef Bassily Kobbi Nissim Uri Stemmer Abhradeep Thakurta

We present new heavy-hitters algorithms satisfying local-differential-privacy, with optimal or nearoptimal worst-case error, running time, and memory. In our algorithms, the server running time is $\tilde O(n)$ and user running time is $\tilde O(1)$, hence improving on the prior state-of-the-art result of Bassily and Smith [STOC 2015] requiring $O(n^{5/2})$ server time and $O(n^{3/2})$ user tim...

2000
V. Ferlet-Cavrois

The worst ease bias during total dose irradiation of partially depleted SOI transistors from two technologies is correlated to the device architecture. Experiments and simulations are used to analyze SOI back transistor threshold voltage shift and charge trapping in the buried oxide

Journal: :Theor. Comput. Sci. 2016
Joshimar Cordova Gonzalo Navarro

The fully-functional succinct tree representation of Navarro and Sadakane (ACM Transactions on Algorithms, 2014) supports a large number of operations in constant time using 2n + o(n) bits. However, the full idea is hard to implement. Only a simplified version with O(lg n) operation time has been implemented and shown to be practical and competitive. We describe a new variant of the original id...

2011
Sameh A. Ibrahim Hatem A. Elayat Mahassen M. Khater Noha A. Mostafa Noha Mostafa et.al

The inventory management of multi-echelon repairable items systems is a major problem as these items are relatively expensive and slow-moving, so, inventory management can be a real problem due to mathematical complexities. In this work, a study was performed in a complex high-value products manufacturer, whose repairable items are both expensive and critical. Data of parts’ failure, storage an...

Journal: :Integration 2007
Sankalp S. Kallakuri Alex Doboli Simona Doboli

In this article we implement a stochastic modeling technique for simulating the communication between processors and arbitration among buses for an embedded SoC. The stochastic models implemented with queues have been used to estimate, through simulation of different arbitration policies, the power consumption and delays, as well as estimate average or worst case scenarios that could occur with...

2003
Sankalp S. Kallakuri Alex Doboli Simona Doboli

In this article we implement a stochastic modeling technique for simulating the communication between processors and arbitration among buses. The stochastic models implemented with queues have been used to estimate through simulation of different arbitration policies the power consumption and delays, as well as estimate average or worst case scenarios that could occur with different architectur...

Journal: :CoRR 2001
Jeff Erickson

The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R3 with spread ∆ has complexity O(∆3). This bound is tight in the worst case for all ∆ = O( √ n). In particular, the Delaunay triangulation of any dense point set has linear complexity. We also generalize this upper bound to re...

2016
Maria Joana Correia Isabel Trancoso Bhiksha Raj

Automatic detection of psychological distress, namely posttraumatic stress disorder (PTSD), depression, and anxiety, is a valuable tool to decrease time, and budget constraints of medical diagnosis. In this work, we propose two supervised approaches, using global vectors (GloVe) for word representation, to detect the presence of psychological distress in adults, based on the analysis of transcr...

2017
Sreenivas Gollapudi Kostas Kollias Debmalya Panigrahi Venetia Pliatsika

We study utility games (Vetta, FOCS 2002) where a set of players join teams to produce social utility, and receive individual utility in the form of payments in return. These games have many natural applications in competitive settings such as labor markets, crowdsourcing, etc. The efficiency of such a game depends on the profit sharing mechanism – the rule that maps utility produced by the pla...

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

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