Výsledky vyhľadávania - "Theoretical computer science"

Quantum cryptography: Public key distribution and coin tossing Autor Bennett, Charles H., Brassard, Gilles

Získať plný text

Deep learning and natural language processing in computation for offensive language detection in online social networks by feature selection and ensemble classification techniques Autor Anand, M., Sahay, Kishan Bhushan, Ahmed, Mohammed Altaf, Sultan, Daniyar, Chandan, Radha Raman, Singh, Bharat

“…Offensive communications have made their way into social media posts. Using computational algorithms to distinguish objectionable content is one of the most…”
Získať plný text

Quantum clustering with k-Means: A hybrid approach Autor Poggiali, Alessandro, Berti, Alessandro, Bernasconi, Anna, Del Corso, Gianna M., Guidotti, Riccardo

“…Quantum computing, based on quantum theory, holds great promise as an advanced computational paradigm for achieving fast computations. Quantum algorithms are…”
Získať plný text

Exploring the gap between treedepth and vertex cover through vertex integrity Autor Gima, Tatsuya, Hanaka, Tesshu, Kiyomi, Masashi, Kobayashi, Yasuaki, Otachi, Yota

“…For problems intractable on graphs of bounded treewidth, two graph parameters treedepth and vertex cover number have been used to obtain fine-grained…”
Získať plný text

Wheeler graphs: A framework for BWT-based data structures Autor Gagie, Travis, Manzini, Giovanni, Sirén, Jouni

“…The famous Burrows–Wheeler Transform (BWT) was originally defined for a single string but variations have been developed for sets of strings, labeled trees, de…”
Získať plný text

From black-box complexity to designing new genetic algorithms Autor Doerr, Benjamin, Doerr, Carola, Ebel, Franziska

“…Black-box complexity theory recently produced several surprisingly fast black-box optimization algorithms. In this work, we exhibit one possible reason: These…”
Získať plný text

Variety of mutual-visibility problems in graphs Autor Cicerone, Serafino, Di Stefano, Gabriele, Drožđek, Lara, Hedžet, Jaka, Klavžar, Sandi, Yero, Ismael G.

“…If X is a subset of vertices of a graph G, then vertices u and v are X-visible if there exists a shortest u,v-path P such that V(P)∩X⊆{u,v}. If each two…”
Získať plný text

How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys Autor Witt, Carsten

“…The benefits of using crossover in crossing fitness gaps have been studied extensively in evolutionary computation. Recent runtime results show that…”
Získať plný text

Optimizing hybrid metaheuristic algorithm with cluster head to improve performance metrics on the IoT Autor Khan, Mohd Abdul Rahim, Shavkatovich, Shavkatov Navruzbek, Nagpal, Bharti, Kumar, Anil, Haq, Mohd Anul, Tharini, V. Jeevika, Karupusamy, Sathishkumar, Alazzam, Malik Bader

“…The Internet of Things (IoT) has subsequently been applied to a variety of sectors, including smart grids, farming, weather prediction, power generation,…”
Získať plný text

Computing maximal cliques in link streams Autor Viard, Tiphaine, Latapy, Matthieu, Magnien, Clémence

“…•We introduce delta-cliques, that generalize graph cliques to link streams/time-varying graphs.•We provide a greedy algorithm to compute all delta-cliques of a…”
Získať plný text

Autonomous mobile robots with lights Autor Das, Shantanu, Flocchini, Paola, Prencipe, Giuseppe, Santoro, Nicola, Yamashita, Masafumi

“…We consider the well known distributed setting of computational mobile entities, called robots, operating in the Euclidean plane in Look-Compute-Move (LCM)…”
Získať plný text

Using quantum key distribution for cryptographic purposes: A survey Autor Alléaume, R., Branciard, C., Bouda, J., Debuisschert, T., Dianati, M., Gisin, N., Godfrey, M., Grangier, P., Länger, T., Lütkenhaus, N., Monyk, C., Painchault, P., Peev, M., Poppe, A., Pornin, T., Rarity, J., Renner, R., Ribordy, G., Riguidel, M., Salvail, L., Shields, A., Weinfurter, H., Zeilinger, A.

“…The appealing feature of quantum key distribution (QKD), from a cryptographic viewpoint, is the ability to prove the information-theoretic security (ITS) of…”
Získať plný text

Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover Autor Akiba, Takuya, Iwata, Yoichi

“…We investigate the gap between theory and practice for exact branching algorithms. In theory, branch-and-reduce algorithms currently have the best time…”
Získať plný text

Traveling salesman problems in temporal graphs Autor Michail, Othon, Spirakis, Paul G.

“…In this work, we introduce the notion of time to some well-known combinatorial optimization problems. In particular, we study problems defined on temporal…”
Získať plný text

Distributed Grover's algorithm Autor Qiu, Daowen, Luo, Le, Xiao, Ligang

“…In this paper, we propose a distributed Grover's algorithm, and it requires fewer qubits and has a linear advantage in time complexity compared to the original…”
Získať plný text

Structure connectivity and substructure connectivity of hypercubes Autor Lin, Cheng-Kuan, Zhang, Lili, Fan, Jianxi, Wang, Dajin

“…The connectivity of a network – the minimum number of nodes whose removal will disconnect the network – is directly related to its reliability and fault…”
Získať plný text

Representable Markov categories and comparison of statistical experiments in categorical probability Autor Fritz, Tobias, Gonda, Tomáš, Perrone, Paolo, Fjeldgren Rischel, Eigil

“…Markov categories are a recent categorical approach to the mathematical foundations of probability and statistics. Here, this approach is advanced by stating…”
Získať plný text

An anomaly-based intrusion detection system using recursive feature elimination technique for improved attack detection Autor Kannari, Phanindra Reddy, Chowdary, Noorullah Shariff, Laxmikanth Biradar, Rajkumar

“…The explosive growth of Internet and technologies has resulted in better life-changing services to the society. This drastic change has invariably kept the…”
Získať plný text

Approximate aggregation for tracking quantiles and range countings in wireless sensor networks Autor He, Zaobo, Cai, Zhipeng, Cheng, Siyao, Wang, Xiaoming

“…We consider the problem of tracking quantiles and range countings in wireless sensor networks. The quantiles and range countings are two important aggregations…”
Získať plný text

Improved time complexity analysis of the Simple Genetic Algorithm Autor Oliveto, Pietro S., Witt, Carsten

“…A runtime analysis of the Simple Genetic Algorithm (SGA) for the OneMax problem has recently been presented proving that the algorithm with population size…”
Získať plný text