Zobrazeno 1 - 10
of 4 935
pro vyhledávání: '"Noga P."'
We explore solutions for fairly allocating indivisible items among agents assigned weights representing their entitlements. Our fairness goal is weighted-envy-freeness (WEF), where each agent deems their allocated portion relative to their entitlemen
Externí odkaz:
http://arxiv.org/abs/2411.12696
Autor:
Alon, Noga, Gravin, Nick, Pollner, Tristan, Rubinstein, Aviad, Wang, Hongao, Weinberg, S. Matthew, Zhang, Qianfan
We investigate prophet inequalities with competitive ratios approaching $1$, seeking to generalize $k$-uniform matroids. We first show that large girth does not suffice: for all $k$, there exists a matroid of girth $\geq k$ and a prophet inequality i
Externí odkaz:
http://arxiv.org/abs/2411.11741
Microrobots engineered from self-propelling active particles, extend the reach of robotic operations to submillimeter dimensions and are becoming increasingly relevant for various tasks, such as manipulation of micro/nanoscale cargo, particularly tar
Externí odkaz:
http://arxiv.org/abs/2411.07177
Let $d \geq 1$ and $s \leq 2^d$ be nonnegative integers. For a subset $A$ of vertices of the hypercube $Q_n$ and $n\geq d$, let $\lambda(n,d,s,A)$ denote the fraction of subcubes $Q_d$ of $Q_n$ that contain exactly $s$ vertices of $A$. Let $\lambda(n
Externí odkaz:
http://arxiv.org/abs/2410.20498
Autor:
Brief, Meni, Ovadia, Oded, Shenderovitz, Gil, Yoash, Noga Ben, Lemberg, Rachel, Sheetrit, Eitam
The application of large language models (LLMs) in domain-specific contexts, including finance, has expanded rapidly. Domain-specific LLMs are typically evaluated based on their performance in various downstream tasks relevant to the domain. In this
Externí odkaz:
http://arxiv.org/abs/2410.01109
A family $\mathcal{F}$ of subsets of $[n]=\{1,2,\ldots,n\}$ shatters a set $A \subseteq [n]$ if for every $A' \subseteq A$ there is an $F \in \mathcal{F}$ such that $F \cap A=A'$. We develop a framework to analyze $f(n,k,d)$, the maximum possible num
Externí odkaz:
http://arxiv.org/abs/2409.12945
A binary code Enc$:\{0,1\}^k \to \{0,1\}^n$ is $(0.5-\epsilon,L)$-list decodable if for all $w \in \{0,1\}^n$, the set List$(w)$ of all messages $m \in \{0,1\}^k$ such that the relative Hamming distance between Enc$(m)$ and $w$ is at most $0.5 -\epsi
Externí odkaz:
http://arxiv.org/abs/2409.01708
Autor:
Chen, Yenho, Mudrik, Noga, Johnsen, Kyle A., Alagapan, Sankaraleengam, Charles, Adam S., Rozell, Christopher J.
Time-varying linear state-space models are powerful tools for obtaining mathematically interpretable representations of neural signals. For example, switching and decomposed models describe complex systems using latent variables that evolve according
Externí odkaz:
http://arxiv.org/abs/2408.16862
We introduce the \emph{graphical reconfigurable circuits (GRC)} model as an abstraction for distributed graph algorithms whose communication scheme is based on local mechanisms that collectively construct long-range reconfigurable channels (this is a
Externí odkaz:
http://arxiv.org/abs/2408.10761
Publikováno v:
Journal of Mining and Metallurgy. Section B: Metallurgy, Vol 56, Iss 3, Pp 415-424 (2020)
Rare earth magnets based upon neodymium-iron-boron (NdFeB) are employed in many high tech applications, including hard disk drives (HDDs). The key elements in manufacturing NdFeB magnets are rare earth elements (REEs) such as neodymium. This element
Externí odkaz:
https://doaj.org/article/7917f1993e9648e9a93be165348ecc31
