Search
Search Results
-
Parallel Repetition of \((k_1,\dots ,k_{\mu })\) -Special-Sound Multi-round Interactive Proofs
In many occasions, the knowledge error \(\kappa \)...
-
Communal Ritual Play: Repetition and Interpretation of Game Narratives Across Communities
Storytelling has always been a communal activity and video games are no different, yet, work on designing story experiences that emphasize the...
-
Emerging resources, enduring challenges: a comprehensive study of Kashmiri parallel corpus
This study addresses the critical shortage of parallel corpora for the Kashmiri language, a significant barrier to advancing language processing...
-
Breaking Parallel ROS: Implication for Isogeny and Lattice-Based Blind Signatures
Many of the three-round blind signatures based on identification protocols are only proven to be...
-
Fast chaotic encryption scheme based on separable moments and parallel computing
In this paper, we propose three novel image encryption algorithms. Separable moments and parallel computing are combined in order to enhance the...
-
Balanced parallel triangle enumeration with an adaptive algorithm
Triangle enumeration is a foundation brick for solving harder graph problems related to social networks, the Internet and transportation, to name a...
-
Addressing the data gap: building a parallel corpus for Kashmiri language
This paper marks a significant step forward in language technology for low-resource languages by develo** the first parallel corpus for the...
-
Implementation and testing of parallel PSO to attain speedup on general purpose computer systems
Many real-world problems in the science and engineering field can be modeled as complex mathematical optimization problem and can be easily solved by...
-
Approaching Repetition Thresholds via Local Resampling and Entropy Compression
We analyze a simple algorithm, transforming an input word into a word avoiding certain repetitions such as fractional powers and undirected powers....
-
Associating parallel automata network dynamics and strictly one-way cellular automata
We prove that the limit dynamics of any finite automata network under the parallel update schedule correspond exactly to the fixed points of a...
-
Distribution of resources beyond 5G networks with heterogeneous parallel processing and graph optimization algorithms
In this paper, a design model for resource allocation is formulated beyond 5G networks for effective data allocations in each network nodes. In all...
-
M&M’S: Mix and Match Attacks on Schnorr-Type Blind Signatures with Repetition
Blind signatures allow the issuing of signatures on messages chosen by the user so that they ensure blindness of the message against the signer....
-
Efficient parallel graph trimming by arc-consistency
Given a large data graph, trimming techniques can reduce the search space by removing vertices without outgoing edges. One application is to speed up...
-
Component stability in low-space massively parallel computation
In this paper, we study the power and limitations of component-stable algorithms in the low-space model of massively parallel computation (
MPC ) ....
-
A hybrid technique using minimal spanning tree and analytic hierarchical process to prioritize functional requirements for parallel software development
Software for large enterprises such as the enterprise resource planning (ERP) is more likely to be developed by a team of software developers where...
-
Oblique random forests with binary and ternary decision structures and non-parallel hyperplanes classifiers
Due to their robust nature, ensemble methods have gained a lot of popularity these days. In this work, we propose several variations of oblique...
-
Parallel Pattern Enumeration in Large Graphs
Graphlet enumeration is a fundamental problem to discover interesting patterns hidden in graphs. It has many applications in science including...
-
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence
Hardness amplification is a central problem in the study of interactive protocols. While “natural” parallel repetition transformation is known to...
-
Scalable feature subset selection for big data using parallel hybrid evolutionary algorithm based wrapper under apache spark environment
Extant sequential wrapper-based feature subset selection (FSS) algorithms are not scalable and yield poor performance when applied to big datasets....
