Results 111 to 120 of about 73,753 (309)
, 2008 In this thesis we consider the class of simple graphs defined by excluding even holes (i.e. chordless cycles of even length). These graphs are known as even-hole-free graphs. We first prove that every even-hole-free graph has a node whose neighborhood is
Da Silva, Murilo Vicente Gonçalves
core
A random polynomial time algorithm for well-rounding convex bodies [PDF]
, 1995 We present a random polynomial time algorithm for well-rounding convex bodies K in the following sense: Given K ⊆ R and ε > 0, the algorithm, with probability at least 1 — ε, computes two simplices △∗ and △∗∗, where △∗∗ is the blow up of △∗ from its ...
Faigle, U. +8 more
core +1 more source
Advanced Science, EarlyView.SPADE integrates spatial transcriptomics with single‐cell RNA sequencing by using cell–cell communications (CCC) as a guide for spatial mapping. It improves cell‐type localization, enhances sparse gene‐expression signals, and reveals CCC programs at single‐spot resolution.
Xinyi Li, Ning Zhang, Zijie Jin
wiley +1 more source
Inversion of Parahermitian matrices
, 2010 Parahermitian matrices arise in broadband multiple-input multiple-output (MIMO) systems or array processing, and require inversion in some instances. In this paper, we apply a polynomial eigenvalue decomposition obtained by the sequential best rotation ...
Weiss, Stephan +2 more
core
Polynomial approach to discrete-time adaptive control: Software implementation for industrial application [PDF]
, 2015 The main aim of this paper is to present a preliminary industrial software implementation of selected discrete-time adaptive control algorithms into the Matlab and Pascal environment.
Matušů, Radek +2 more
core
A Polynomial Time Algorithm For 0-1 Integer Linear Programmings
, 2023 A polynomial-time algorithm for 0-1 integer linear programmings has been proposed. This method continues the classic idea of solving ILP with its LP relaxation. The innovation is that every constraint in the LP is reconstructed into a strong cut.
Zhang, G. Q.
core
Hardness of approximation for orthogonal rectangle packing and covering problems [PDF]
, 2009 Bansal and Sviridenko [N. Bansal, M. Sviridenko, New approximability and inapproximability results for 2-dimensional bin packing, in: Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA, 2004, pp.
Chlebikova, Janka +4 more
core +1 more source
Advanced Electronic Materials, EarlyView.Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley +1 more source
Linear and ellipsoidal pattern separation: theoretical aspects and experimental analysis
, 2009 This thesis deals with a pattern classification problem, which geometrically implies data separation in some Euclidean feature space. The task is to infer a classifier (a separating surface) from a set or sequence of observations.
Kharechko, Andriy
core
Model‐Based Time‐Modulated Write Algorithm for 1R Analog Memristive Crossbar Arrays
Advanced Electronic Materials, EarlyView.A novel model‐based time‐modulated write algorithm efficiently programs analog 1R memristive crossbar arrays by varying pulse duration at a fixed voltage. By leveraging a physics‐based compact model and a dynamic gain mechanism, this approach overcomes device nonlinearities and parasitic effects.
Richard Schroedter +7 more
wiley +1 more source