Results 51 to 60 of about 3,005 (232)
Lasso for hierarchical polynomial models
Abstract The divisibility conditions implicit in a polynomial hierarchy suggest parameter constraints in regression. With this idea, we establish strong and weak hierarchies for both the lasso and relaxed lasso. Our proposal extends prior work on hierarchical lasso, which was mainly concerned with models of degree 2.
H. Maruri‐Aguilar, S. Lunagómez
wiley +1 more source
Reflex seizures and epilepsy surgery: A network approach case‐based exploration
Abstract Context Reflex seizures (RS) are defined by their consistent provocation by specific stimuli, encompassing a broad range from elementary sensory inputs to complex cognitive tasks. While RS are often encountered in clinical practice, their surgical management remains sparsely reported and poorly systematized.
Olivier Aron +6 more
wiley +1 more source
Proxy re-signature enables transitive authentication of digital identities across different domains and has significant application value in areas such as digital rights management, cross-domain certificate validation, and distributed system access ...
Zhanzhen Wei +4 more
doaj +1 more source
Reduction of Bus Transition for Compressed Code Systems
Low power VLSI circuit design is one of the most important issues in present day technology. One of the ways of reducing power is to reduce the number of transitions on the bus. The main focus here is to present a method for reducing the power consumption of compressed-code systems by inverting the bits that are transmitted on the bus. Compression will
S. R. Malathi, R. Ramya Asmi
openaire +2 more sources
The Strong Nash‐Williams Orientation Theorem for Rayless Graphs
ABSTRACT In 1960, Nash‐Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of arc‐disjoint directed paths between any two vertices is at least half the number of undirected edge‐disjoint paths between them (rounded down).
Max Pitz, Jacob Stegemann
wiley +1 more source
ABSTRACT A 2‐edge‐coloured graph G $G$ is called locally complete if for each vertex v $v$, the vertices adjacent to v $v$ through edges of the same colour induce a complete subgraph in G $G$. Locally complete 2‐edge‐coloured graphs have nice properties, and there exists a polynomial algorithm to decide whether such a graph has an alternating ...
Jørgen Bang‐Jensen, Jing Huang
wiley +1 more source
Fully Dynamic Algorithms for Transitive Reduction
Accepted at ICALP ...
Gramoz Goranci +3 more
openaire +4 more sources
ABSTRACT Lovász et al. proved that every six‐edge‐connected graph has a nowhere‐zero three‐flow. In fact, they proved a more technical statement, which says that there exists a nowhere‐zero three‐flow that extends the flow prescribed on the incident edges of a single vertex z $z$ with bounded degree. We extend this theorem of Lovász et al.
Arnbjörg Soffía Árnadóttir +5 more
wiley +1 more source
ABSTRACT Traditional reward systems, which are largely salary‐centered and structurally rigid, are no longer sufficient in an era defined by digital transformation. Building on this premise, this study examines how emerging technologies reshape integrated compensation systems by uncovering their causal, mediating, and outcome‐oriented roles.
Seyed Hossein Razavi Hajiagha +5 more
wiley +1 more source
Peskine Sixfolds and Debarre–Voisin Fourfolds With Associated Cubic Fourfolds
ABSTRACT We develop the notion of Peskine sixfolds with associated K3 surfaces and cubic fourfolds and work out numerical conditions for when these associations occur. In discriminant 24, the first family for which there is an associated cubic fourfold, we identify the cubic explicitly.
Corey Brooke +3 more
wiley +1 more source

