Results 31 to 40 of about 23,812 (301)
Sorting and searching in the presence of memory faults (without redundancy) [PDF]
, 2004 We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce a correct output on the set of uncorrupted values.
ITALIANO G +4 more
core +1 more source
Engineering Science and Technology, an International Journal, 2017 Controllers in some power system problems are required to satisfy different performance objectives, which could be conflicting with one another. Therefore in the process of their gain tuning, when the problem is formulated within an optimization ...
S. Chaine, M. Tripathy, Divesh Jain
doaj +1 more source
Optimal resilient sorting and searching in the presence of memory faults [PDF]
, 2006 We investigate the problem of reliable computation in the presence of faults that may arbitrarily corrupt memory locations. In this framework, we consider the problems of sorting and searching in optimal time while tolerating the largest possible number ...
FINOCCHI, Irene +4 more
core +1 more source
An Efficient Two-Server Ranked Dynamic Searchable Encryption Scheme
IEEE Access, 2020 Searchable encryption (SE) allows users to search over encrypted data without decrypting. In most existing SE schemes, server returns all matched files without relevance ranking, and the update mechanism are suffering with high communication and ...
Yuxi Li, Fucai Zhou, Zifeng Xu, Yue Ge
doaj +1 more source
Innovative Homomorphic Sorting of Environmental Data in Area Monitoring Wireless Sensor Networks
IEEE AccessIn many special cases, the data collected from wireless sensor networks are stored in encrypted form to provide the required privacy. Sorting is an essential operation on any stored data for orderly presentation and fast searching.
Neeta B. Malvi, N. Shylashree
doaj +1 more source
A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho +7 more
wiley +1 more source
Parallel Pairwise Operations on Data Stored in DNA: Sorting, Shifting, and Searching [PDF]
, 2021 Prior research has introduced the Single-Instruction-Multiple-Data paradigm for DNA computing (SIMD DNA). It offers the potential for storing information and performing in-memory computations on DNA, with massive parallelism.
Chen, Tonglin +2 more
core +1 more source
Sorting and Searching Behind the Curtain
, 2015 We propose a framework where a user can outsource his data to a cloud server in an encrypted form and then request the server to perform computations on this data and sort the result. Sorting is achieved via a novel protocol where the server is assisted by a secure coprocessor that is required to have only minimal computational and memory resources ...
Baldimtsi, F., Ohrimenko, O.
openaire +2 more sources
FEBS Letters, EarlyView.Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
, 1973 Chapter 5 is concerned with sorting into order, internal sorting and external sorting. Chapter 6 deals with the problem of searching for specified items in tables or files. It is subdivided into methods which search sequentially, or by comparison of keys,
D. Knuth
core