Results 31 to 40 of about 2,582,277 (310)
Characterisations of Ideal Threshold Schemes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 We characterise ideal threshold schemes from different approaches. Since the characteristic properties are independent to particular descriptions of threshold schemes all ideal threshold schemes can be examined by new points of view and new results on ...
Josef Pieprzyk, Xian-Mo Zhang
doaj +1 more source
On Cheating Immune Secret Sharing [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 The paper addresses the cheating prevention in secret sharing. We consider secret sharing with binary shares. The secret also is binary. This model allows us to use results and constructions from the well developed theory of cryptographically strong ...
Josef Pieprzyk, Xian-Mo Zhang
doaj +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Japan has one of the highest dialysis prevalence rates worldwide and a shrinking, aging population. Whether dialysis burden has entered a sustained post‐peak phase or whether recent declines partly reflect pandemic‐related disruptions remains uncertain.
Hatice Şahin +2 more
wiley +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Introduction Peritoneal dialysis (PD) is an established home‐based kidney replacement therapy (KRT), but its uptake remains low in Japan. We evaluated whether individualized education in a dedicated outpatient clinic was associated with the initiation of PD.
Yasuko Ito +7 more
wiley +1 more source
PathMe: merging and exploring mechanistic pathway knowledge
BMC Bioinformatics, 2019 Background The complexity of representing biological systems is compounded by an ever-expanding body of knowledge emerging from multi-omics experiments.
Daniel Domingo-Fernández +4 more
doaj +1 more source
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018 The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in learning theory, differential privacy, and algorithm design in general.
openaire +5 more sources
, 2022 Why not have a computer just draw a map? This is something you hear a lot when people talk about gerrymandering, and it's easy to think at first that this could solve redistricting altogether. But there are more than a couple problems with this idea. In this chapter, two computer scientists survey what's been done in algorithmic redistricting, discuss ...
Amariah Becker, Justin Solomon 0001
openaire +3 more sources
Total Order Broadcast and Multicast Algorithms : Taxonomy and Survey [PDF]
, 2003 Total order broadcast and multicast (also called atomic broadcast or atomic multicast) is an important problem in distributed systems, especially with respect to fault-tolerance.
Schiper, Andre +2 more
core +4 more sources
Typical Sequences Revisited - Computing Width Parameters of Graphs [PDF]
, 2020 In this work, we give a structural lemma on merges of typical sequences, a notion that was introduced in 1991 [Lagergren and Arnborg, Bodlaender and Kloks, both ICALP 1991] to obtain constructive linear time parameterized algorithms for treewidth and ...
Bläser, Markus +6 more
core +2 more sources
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source