Results 61 to 70 of about 1,222,002 (199)
Substitution-closed pattern classes [PDF]
, 2011 The substitution closure of a pattern class is the class of all permutations obtained by repeated substitution. The principal pattern classes (those defined by a single restriction) whose substitution closure can be defined by a finite number of ...
Atkinson, M.D. +7 more
core +1 more source
Supervised Protein Structure Classification Using Topological Persistence With DeltaFold
Proteins: Structure, Function, and Bioinformatics, EarlyView.ABSTRACT Recent advances in protein structure prediction have considerably increased the number of available structures, underscoring the need for scalable and accurate methods to compare and classify this huge amount of data. Current approaches based on sequence alignment or structural superposition often lack sensitivity and/or are computationally ...
Joseph Nardin‐Gennequin +3 more
wiley +1 more source
Sliding Mode Control and Observation for Upper Limb Robotics Rehabilitation
International Journal of Robust and Nonlinear Control, EarlyView.ABSTRACT Stroke is a leading cause of upper limb motor impairments, which often require rehabilitation. General purpose robotic manipulators enable effective therapy through exercises such as Center Out Point‐to‐Point (CO‐PTP) and Teach‐and‐Track (TT), which respectively demand accurate estimation and rejection of the interaction force exerted by the ...
Antonella Ferrara +2 more
wiley +1 more source
Decomposing Berge graphs and detecting balanced skew partitions [PDF]
We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We give an O(n9)-time algorithm for the same problem restricted to Berge graphs.
Nicolas Trotignon
core
Australian Journal of Agricultural and Resource Economics, EarlyView.ABSTRACT In agriculture, production technologies are often characterised by non‐linearities and stochastic dependence between outputs, particularly between desirable and undesirable outputs. This paper combines the copula‐based semi‐parametric framework for modelling heterogeneous dependence with the by‐production stochastic frontier approach and ...
Kofivi Dzegle, Ioannis Skevas
wiley +1 more source
An extension of the basic local independence model to multiple observed classifications
British Journal of Mathematical and Statistical Psychology, EarlyView.Abstract The basic local independence model (BLIM) is appropriate in situations where populations do not differ in the probabilities of the knowledge states and the probabilities of careless errors and lucky guesses of the items. In some situations, this is not the case. This work introduces the multiple observed classification local independence model
Pasquale Anselmi +8 more
wiley +1 more source
Normal hypergraphs and the perfect graph conjecture [PDF]
, 2006 A hypergraph is called normal if the chromatic index of any partial hypergraph H′ of it coincides with the maximum valency in H′. It is proved that a hypergraph is normal iff the maximum number of disjoint hyperedges coincides with the minimum number of ...
Lovász, L.
core +1 more source
, 1994 Suatu graph G, diambil jumlah titik dari clique maksimal sebagai dasar dalam pewarnaan titik-titik pada graph tersebut. Banyaknya warna paling sedikit yang digunakan untuk 3Dewarnaan tersebut dibandingkan dengan jumlah titik dari clique maksimal.
Mulyani , Sri
core +1 more source
Differentiable Randers‐Finsler Eikonal Solvers
Computer Graphics Forum, EarlyView.Abstract Fast and differentiable solvers for anisotropic and asymmetric distance fields are a key primitive in geometry processing, enabling gradient‐based optimization over metrics, drift fields, and downstream objectives that depend on geodesic distances and geodesics.
Barak Gahtan +2 more
wiley +1 more source
Folk Theorems with Bounded Recall under (Almost) Perfect Monitoring, Third Version [PDF]
We prove the perfect-monitoring folk theorem continues to hold when attention is restricted to strategies with bounded recall and the equilibrium is essentially required to be strict.
George J. Mailath, Wojciech Olszewski
core