Zobrazeno 1 - 10
of 520
pro vyhledávání: '"Klein, Philip A."'
Autor:
Covi, Erika, Duong, Quang T., Lancaster, Suzanne, Havel, Viktor, Coignus, Jean, Barbot, Justine, Richter, Ole, Klein, Philip, Chicca, Elisabetta, Grenouillet, Laurent, Dimoulas, Athanasios, Mikolajick, Thomas, Slesazeck, Stefan
Publikováno v:
2021 IEEE International Symposium on Circuits and Systems (ISCAS), 2021, pp. 1-5
Ferroelectric tunneling junctions (FTJ) are considered to be the intrinsically most energy efficient memristors. In this work, specific electrical features of ferroelectric hafnium-zirconium oxide based FTJ devices are investigated. Moreover, the imp
Externí odkaz:
http://arxiv.org/abs/2107.01853
The (non-uniform) sparsest cut problem is the following graph-partitioning problem: given a "supply" graph, and demands on pairs of vertices, delete some subset of supply edges to minimize the ratio of the supply edges cut to the total demand of the
Externí odkaz:
http://arxiv.org/abs/2105.15187
Understanding the structure of minor-free metrics, namely shortest path metrics obtained over a weighted graph excluding a fixed minor, has been an important research direction since the fundamental work of Robertson and Seymour. A fundamental idea t
Externí odkaz:
http://arxiv.org/abs/2009.05039
Redistricting is the problem of dividing a state into a number $k$ of regions, called districts. Voters in each district elect a representative. The primary criteria are: each district is connected, district populations are equal (or nearly equal), a
Externí odkaz:
http://arxiv.org/abs/2009.00188
The Sparsest Cut is a fundamental optimization problem that has been extensively studied. For planar inputs the problem is in $P$ and can be solved in $\tilde{O}(n^3)$ time if all vertex weights are $1$. Despite a significant amount of effort, the be
Externí odkaz:
http://arxiv.org/abs/2007.02377
Autor:
Jue, Stephen, Klein, Philip N.
We consider the Minimum Steiner Cut problem on undirected planar graphs with non-negative edge weights. This problem involves finding the minimum cut of the graph that separates a specified subset $X$ of vertices (terminals) into two parts. This prob
Externí odkaz:
http://arxiv.org/abs/1912.11103
Publikováno v:
In The Journal of Allergy and Clinical Immunology: In Practice August 2023 11(8):2468-2475
The Capacitated Vehicle Routing problem is to find a minimum-cost set of tours that collectively cover clients in a graph, such that each tour starts and ends at a specified depot and is subject to a capacity bound on the number of clients it can ser
Externí odkaz:
http://arxiv.org/abs/1901.07032
Autor:
Klein, Philip (AUTHOR)
Publikováno v:
National Review. Jan2025, Vol. 77 Issue 1, p41-43. 3p. 2 Color Photographs.