Zobrazeno 1 - 10
of 192
pro vyhledávání: ''
Autor:
Futa Watanabe
Publikováno v:
IEEE Access, Vol 9, Pp 10820-10828 (2021)
We propose a novel localization method using angle-of-arrival (AoA) measurements with two-step error variance-weighted least squares (TELS). The first step is to estimate a terminal location provisionally using least squares. The second step is to es
Publikováno v:
IEEE Access, Vol 9, Pp 29346-29355 (2021)
The Roman domination in a graph $G$ is a variant of the classical domination, defined by means of a so-called Roman domination function $f\colon V(G)\to \{0,1,2\}$ such that if $f(v)=0$ then, the vertex $v$ is adjacent to at least one vertex $w$ with
Publikováno v:
VTC Spring
In this paper, we have analyzed the average bit error rate (ABER) performance of a multiple-input-multiple-output (MIMO) free-space optical (FSO) communication link employing both transmitter and receiver diversity techniques. For the proposed MIMO F
Publikováno v:
CISS
This paper studies bandits with knapsacks (BwK). In a BwK instance, there are a set of $n$ arms and $d$ types of resources with limited budgets. Each pull of an arm returns a noisy reward and consumes some amount of resources in each type according t
Publikováno v:
ICPR
Mutual information (MI) is an information-theoretic measure of dependency between two random variables. Several methods to estimate MI from samples of two random variables with unknown underlying probability distributions have been proposed in the li
Publikováno v:
2020 14th International Conference on Telecommunication Systems, Services, and Applications (TSSA.
This paper presents a novel approximate divider circuit using binomial expansion. The circuit is approximated using the division between A and $L = {2^{\left\lfloor {{{\log }_2}B} \right\rfloor }}$, where ⌊log 2 B⌋ is the most significant bit val
Publikováno v:
ISMVL
Methods to generate p-valued bent functions of an odd number of variables are addressed. An extension of the Maiorana method originally developed to generate bent functions of an even number of variables is presented. It is shown that the simplest Ma
Autor:
Omri Weinstein, Young Kun Ko
Publikováno v:
FOCS
In 2010, P\v{a}tra\c{s}cu proposed the following three-phase dynamic problem, as a candidate for proving polynomial lower bounds on the operational time of dynamic data structures: I: Preprocess a collection of sets $\vec{S} = S_1, \ldots , S_k \subs
Publikováno v:
FOCS
We develop algorithms for writing a polynomial as sums of powers of low degree polynomials. Consider an $n$-variate degree-$d$ polynomial $f$ which can be written as $$f = c_1Q_1^{m} + \ldots + c_s Q_s^{m},$$ where each $c_i\in \mathbb{F}^{\times}$,
Autor:
Rahul Ilango
Publikováno v:
FOCS
Attempts to prove the intractability of the Minimum Circuit Size Problem (MCSP) date as far back as the 1950s and are well-motivated by connections to cryptography, learning theory, and average-case complexity. In this work, we make progress, on two