Results 41 to 50 of about 31,167 (325)
The design of algorithms is one of the hardest topics of high school computer science. This is mainly due to the universality of algorithms as solution methods that guarantee the calculation of a correct solution for all potentially infinitely many ...
Juraj Hromkovič, Regula Lacher
doaj +1 more source
The scaling of mental computation in a sorting task
Many cognitive models provide valuable insights into human behavior. Yet the algorithmic complexity of candidate models can fail to capture how human reaction times scale with increasing input complexity.
Charley M. Wu +3 more
core +1 more source
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
An Efficient Two-Server Ranked Dynamic Searchable Encryption Scheme
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
Efficient Sorting and Searching in Rendering Algorithms
In the proposed tutorial we would like to highlight the connection between rendering algorithms and sorting and searching as classical problems studied in computer science.
Bittner, Jiri, Havran, Vlastimil
core +1 more source
—Searching is one of the oldest core mechanism of nature. Nature is changing gradually along with searching approaches too. Data Mining is one of the most important industrials topic now-a-days.
Md. Harun Or Rashid, Ahmed Imtiaz
semanticscholar +1 more source
Algorithm Engineering for Sorting and Searching, and All That (Invited Talk)
We look at several proposals to engineer the set of fundamental searching and sorting algorithms. Aspects are improving locality of disk access and cache access, the efficiency tuning by reducing the number of branch mispredictions, and reducing at ...
Edelkamp, Stefan
core +1 more source
Parallel Pairwise Operations on Data Stored in DNA: Sorting, Shifting, and Searching [PDF]
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
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
Innovative Homomorphic Sorting of Environmental Data in Area Monitoring Wireless Sensor Networks
In 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

