Results 71 to 80 of about 719,735 (175)
On an almost-universal hash function family with applications to authentication and secrecy codes [PDF]
, 2017 Universal hashing, discovered by Carter and Wegman in 1979, has many important applications in computer science. MMH$^*$, which was shown to be $\Delta$-universal by Halevi and Krawczyk in 1997, is a well-known universal hash function family.
Bibak, Khodakhast +3 more
core +1 more source
Resilient Randomized Quantized Consensus
, 2017 We consider the problem of multi-agent consensus where some agents are subject to faults/attacks and might make updates arbitrarily. The network consists of agents taking integer-valued (i.e., quantized) states under directed communication links.
Dibaji, Seyed Mehran +2 more
core +1 more source
There Exist some Omega-Powers of Any Borel Rank [PDF]
, 2007 Omega-powers of finitary languages are languages of infinite words (omega-languages) in the form V^omega, where V is a finitary language over a finite alphabet X.
Finkel, Olivier, Lecomte, Dominique
core +3 more sources
Strategies in Underwriting the Costs of Catastrophic Disease [PDF]
, 1976 In this thesis we address the problem of integrated software pipelining for clustered VLIW architectures. The phases that are integrated and solved as one combined problem are: cluster assignment, instruction selection, scheduling, register allocation ...
Havighurst, Clark C. +2 more
core +1 more source
Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games
, 2008 We show that there is a polynomial-time approximation scheme for computing Nash equilibria in anonymous games with any fixed number of strategies (a very broad and important class of games), extending the two-strategy result of Daskalakis and ...
Daskalakis, Constantinos +1 more
core +2 more sources
Design of efficient digital interpolation filters for integer upsampling [PDF]
, 2004 Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.Includes bibliographical references (leaf 44).Digital signal interpolation systems can be implemented in a variety of ways. The most basic
Turek, Daniel B. (Daniel Bernard), 1980-
core
Integer Linear Programming for Sequence Problems: A general approach to reduce the problem size [PDF]
, 2016 Sequence problems belong to the most challenging interdisciplinary topics of the actuality. They are ubiquitous in science and daily life and occur, for example, in form of DNA sequences encoding all information of an organism, as a text (natural or ...
Zörnig, Peter
core
A Faster Distributed Single-Source Shortest Paths Algorithm
, 2018 We devise new algorithms for the single-source shortest paths (SSSP) problem with non-negative edge weights in the CONGEST model of distributed computing.
Forster, Sebastian, Nanongkai, Danupon
core +1 more source
Constructing a Canonical form of a Matrix in Several Problems about Combinatorial Designs [PDF]
, 2008 Partially supported by the Bulgarian Science Fund contract with TU Varna, No 487.The author developed computer programs needed for the classification of designs with certain automorphisms by the local approach method.
Mateva, Zlatka
core
Parameterizing by the Number of Numbers
, 2010 The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization". In this paper we introduce and explore a novel but general form of parameterization: the number of numbers.
C. Komusiewicz +13 more
core +3 more sources