Results 31 to 40 of about 2,482,039 (287)
Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP [PDF]
Symposium on the Theory of Computing, 2010 Raghavendra (STOC 2008) gave an elegant and surprising result: if Khot's Unique Games Conjecture (STOC 2002) is true, then for every constraint satisfaction problem (CSP), the best approximation ratio is attained by a certain simple semidefinite ...
Yuichi Yoshida
semanticscholar +1 more source
On the Incomparability of Cache Algorithms in Terms of Timing Leakage [PDF]
Logical Methods in Computer Science, 2019 Modern computer architectures rely on caches to reduce the latency gap between the CPU and main memory. While indispensable for performance, caches pose a serious threat to security because they leak information about memory access patterns of programs ...
Pablo Cañones, Boris Köpf, Jan Reineke
doaj +1 more source
Online Learning Approaches in Maximizing Weighted Throughput in an Unreliable Channel
Tsinghua Science and Technology, 2012 We design online algorithms to schedule unit-length packets with values and deadlines through an unreliable communication channel. In this model, time is discrete. Packets arrive over time; each packet has a non-negative value and an integer deadline. In
Zhi Zhang, Fei Li
doaj +1 more source
Partition-Merge: Distributed Inference and Modularity Optimization
IEEE Access, 2021 This paper presents a novel meta-algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our novel randomized
Vincent Blondel +4 more
doaj +1 more source
Constant-time Quantum Algorithm for Homology Detection of Closed Curves
Optica Quantum 2.0 Conference and Exhibition, 2023 Given an oracle that could query the inclusion of edges on a closed curve, we give a constant-time (single query usage) quantum algorithm that determines whether or not that curve is homologous to zero on a two-dimensional manifold.
Vu, Nhat Anh Nghiem +2 more
openaire +4 more sources
S-RASTER: contraction clustering for evolving data streams
Journal of Big Data, 2020 Contraction Clustering (RASTER) is a single-pass algorithm for density-based clustering of 2D data. It can process arbitrary amounts of data in linear time and in constant memory, quickly identifying approximate clusters.
Gregor Ulm +4 more
doaj +1 more source
A comparative study of two algorithms of multi - processor scheduling [PDF]
مجلة التربية والعلم, 2005 This study tackles the processes scheduling problem of multiprocessor and describing two algorithms from many algorithms for an array of dependent processes, which are represented by, direct a cj'clic Graph on different forms correlation among the ...
Isra Al-Kallak, Ahmed Al-Sabawi
doaj +1 more source
Algorithms for non-Hamiltonian dynamics
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2010 Statistical averages in a variety of many-body problems can be efficiently calculated through deterministic dynamics. When thermodynamical constraints (such as constant-temperature and/or constant-pressure) must be enforced, energy-conserving non ...
Alessandro Sergi, Gregory S. Ezra
doaj +1 more source
Approximate Counting for Spin Systems in Sub-Quadratic Time [PDF]
TheoretiCSWe present two randomised approximate counting algorithms with $\widetilde{O}(n^{2-c}/\varepsilon^2)$ running time for some constant $c>0$ and accuracy $\varepsilon$: (1) for the hard-core model with fugacity $\lambda$ on graphs with maximum degree $
Konrad Anand +4 more
doaj +1 more source
First-order query evaluation on structures of bounded degree [PDF]
Logical Methods in Computer Science, 2011 We consider the enumeration problem of first-order queries over structures of bounded degree. It was shown that this problem is in the Constant-Delaylin class. An enumeration problem belongs to Constant-Delaylin if for an input of size n it can be solved
Wojciech Kazana, Luc Segoufin
doaj +1 more source