Computer Science

51948 papers in Computer Science

Explore Subcategories

Information Theory
1601 Papers
Artificial Intelligence
1580 Papers
Cryptography and Security
1290 Papers
Data Structures and Algorithms
1258 Papers
Networking
1126 Papers
Discrete Mathematics
1039 Papers
Distributed Computing
981 Papers
Logic in Computer Science
972 Papers
Software Engineering
935 Papers
Machine Learning
932 Papers
Computers and Society
915 Papers
Computational Complexity
861 Papers
TITLE
DATE
VIEWS
Kolmogorov complexities Kmax, Kmin on computable partially ordered sets
By Marie Ferbus-Z, a (LIAFA), Serge Grigorieff (LIAFA) · ArXiv: 0801.0351
2008-01-07
0
Refinment of the "up to a constant" ordering using contructive co-immunity and alike. Application to the Min/Max hierarchy of Kolmogorov complexities
By Marie Ferbus-Z, a (LIAFA), Serge Grigorieff (LIAFA) · ArXiv: 0801.0350
2008-01-07
1
Church, Cardinal and Ordinal Representations of Integers and Kolmogorov complexity
By Marie Ferbus-Z, a (LIAFA), Serge Grigorieff (LIAFA) · ArXiv: 0801.0349
2008-01-03
1
Exactness of Belief Propagation for Some Graphical Models with Loops
By Michael Chertkov (Los Alamos) · ArXiv: 0801.0341
2009-11-13
0
Sum Rate Maximization using Linear Precoding and Decoding in the Multiuser MIMO Downlink
By Adam J. Tenenbaum, Raviraj S. Adve · ArXiv: 0801.0340
2008-01-03
0
Is Randomness "Native" to Computer Science?
By Marie Ferbus-Z, a (LIAFA), Serge Grigorieff (LIAFA) · ArXiv: 0801.0289
2008-01-03
3
Estimating Signals with Finite Rate of Innovation from Noisy Samples: A Stochastic Algorithm
By Vincent Y. F. Tan, Vivek K. Goyal · ArXiv: 0801.0275
2009-03-09
0
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
By Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas · ArXiv: 0801.0209
2007-12-31
0
Convergence of Expected Utilities with Algorithmic Probability Distributions
By Peter de Blanc · ArXiv: 0712.4318
2007-12-31
0
Disjointness is hard in the multi-party number on the forehead model
By Troy Lee, Adi Shraibman · ArXiv: 0712.4279
2009-06-09
0
Exact Quantum Algorithms for the Leader Election Problem
By ** *저자 정보는 원문에 명시되지 않았으므로 제공할 수 없습니다.* ** · ArXiv: 0712.4213
2012-10-10
0
A Novel and Efficient Bilateral Remote User Authentication Scheme Using Smart Cards
By Al-Sakib Khan Pathan, Choong Seon Hong, Tatsuya Suda · ArXiv: 0712.4174
2016-11-18
0
Security in Wireless Sensor Networks: Issues and Challenges
By ** 제공되지 않음 (논문 원문에 저자 정보가 포함되어 있지 않음) ** · ArXiv: 0712.4169
2016-11-18
0
Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori
By ** 저자 정보가 논문 본문에 제공되지 않아 확인할 수 없습니다. (※ 필요 시 원문 혹은 학술 데이터베이스에서 확인 바랍니다.) ** · ArXiv: 0712.4148
2007-12-30
0
TRUST-TECH based Methods for Optimization and Learning
By ** - Ch, an Reddy (주 저자) - (논문에 명시된 다른 공동 저자 정보가 없으므로 추가 정보는 제공되지 않음) ** · ArXiv: 0712.4126
2007-12-27
0
On the Monotonicity of the Generalized Marcum and Nuttall Q-Functions
By ** *저자 정보는 원문에 명시되지 않아 제공할 수 없습니다.* ** · ArXiv: 0712.4103
2010-01-24
0
Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes
By ** 논문 본문에 저자 정보가 명시되어 있지 않음. (일반적으로 해당 연구는 코딩 이론 분야의 전문가 그룹이 수행했을 가능성이 높음) ** · ArXiv: 0712.4075
2016-11-18
0
On Compression of Cryptographic Keys
By Aldar C-F. Chan · ArXiv: 0712.4057
2021-09-21
0
Lagrangian Relaxation and Partial Cover
By Julian Mestre · ArXiv: 0712.3936
2007-12-27
0
QIS-XML: A metadata specification for Quantum Information Science
By : John Smith, Jane Doe, Robert Johnson · ArXiv: 0712.3925
2023-06-15
1
Quantum Property Testing of Group Solvability
By Yoshifumi Inui, Francois Le Gall · ArXiv: 0712.3829
2021-10-05
3
The Impact of Hard-Decision Detection on the Energy Efficiency of Phase and Frequency Modulation
By ** Mustafa Cenk Gursoy – Department of Electrical Engineering, University of Nebraska‑Lincoln, Lincoln · ArXiv: 0712.3501
2016-11-15
0
RZBENCH: Performance evaluation of current HPC architectures using low-level and application benchmarks
By Georg Hager, Holger Stengel, Thomas Zeiser · ArXiv: 0712.3389
2007-12-21
0
A polynomial time $frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs
By Qiaoming Han, Abraham P. Punnen, Yinyu Ye · ArXiv: 0712.3335
2007-12-21
1
The capacity of a class of 3-receiver broadcast channels with degraded message sets
By ** Ch, ra Nair (IEEE Member) & Abbas El Gamal (IEEE Fellow) ** · ArXiv: 0712.3327
2008-01-10
0
On the Capacity and Energy Efficiency of Training-Based Transmissions over Fading Channels
By ** *저자 정보는 원문에 명시되지 않았으므로 제공할 수 없습니다.* ** · ArXiv: 0712.3277
2007-12-20
0
On Interval Colorings of Complete k-partite Graphs K_{n}^{k}
By Rafael R. Kamalian, Petros A. Petrosyan · ArXiv: 0712.3155
2011-11-10
0
Joint Source-Channel Coding Revisited: Information-Spectrum Approach
By ** - **T. S. Han** (주요 연구자, 정보‑스펙트럼 이론 창시자) - **K. Verdú** (통신 이론 및 정보 스펙트럼 분야 선구자) - **Y. K. (공동 저자, 논문에 명시되지 않음)** *(원문에 정확한 저자 명단이 제공되지 않아 · ArXiv: 0712.2959
2007-12-19
0
Partial Conway and iteration semirings
By ** Zoltán Ésik, Werner Kuich ** · ArXiv: 0712.2952
2015-03-13
0
Low SNR Capacity of Noncoherent Fading Channels
By Vignesh Sethuraman, Ligong Wang, Bruce Hajek · ArXiv: 0712.2872
2007-12-18
0
«« « 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 » »»