Computer Science

52457 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
Universal Coding for Lossless and Lossy Complementary Delivery Problems
By Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu · ArXiv: 0802.1567
2008-02-13
0
Constructing Linear Codes with Good Joint Spectra
By Shengtian Yang, Yan Chen, Thomas Honold · ArXiv: 0802.1555
2008-08-28
0
Error-Correcting Data Structures
By Ronald de Wolf (CWI Amsterdam) · ArXiv: 0802.1471
2008-12-01
0
3-Way Composition of Weighted Finite-State Transducers
By Cyril Allauzen, Mehryar Mohri · ArXiv: 0802.1465
2008-02-22
0
A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization
By Jacob Abernethy, Francis Bach (INRIA Rocquencourt), Theodoros Evgeniou · ArXiv: 0802.1430
2008-12-19
0
Approximating General Metric Distances Between a Pattern and a Text
By Klim Efremenko, Ely Porat · ArXiv: 0802.1427
2008-02-12
0
Convergence of some leader election algorithms
By Svante Janson, Christian Lavault, Guy Louchard · ArXiv: 0802.1389
2008-02-12
0
Ascending runs in dependent uniformly distributed random variables: Application to wireless networks
By Nathalie Mitton (INRIA Futurs), Katy Paroux (LM-Besanc{c}on), Bruno Sericola (IRISA) · ArXiv: 0802.1387
2008-02-25
0
On Directed Information and Gambling
By Haim H. Permuter, Young-Han Kim, Tsachy Weissman · ArXiv: 0802.1383
2008-02-12
0
New type Stirling like numbers - an email style letter
By ** - 논문 본문에 저자 이름이 명시되지 않아 확인 불가. (‘present author’ 라는 표현만 사용) ** · ArXiv: 0802.1382
2010-11-16
0
Comments on combinatorial interpretation of fibonomial coefficients - an email style letter
By A. K. Kwasniewski · ArXiv: 0802.1381
2008-02-12
0
New Bounds for the Capacity Region of the Finite-State Multiple Access Channel
By Haim H. Permuter, Tsachy Weissman, Jun Chen · ArXiv: 0802.1380
2008-02-12
0
Structure and Optimality of Myopic Policy in Opportunistic Access with Noisy Observations
By Qing Zhao, Bhaskar Krishnamachari · ArXiv: 0802.1379
2008-11-13
0
An integral formula for large random rectangular matrices and its application to analysis of linear vector channels
By Yoshiyuki Kabashima · ArXiv: 0802.1372
2008-02-21
0
Interior-Point Algorithms for Linear-Programming Decoding
By Pascal O. Vontobel · ArXiv: 0802.1369
2008-02-12
0
A connection between palindromic and factor complexity using return words
By Michelangelo Bucci, Aless, ro De Luca · ArXiv: 0802.1332
2010-04-08
0
Exchange of Limits: Why Iterative Decoding Works
By ** Satish Babu Korada, Rüdiger Urbanke ** · ArXiv: 0802.1327
2008-02-12
0
Untangling polygons and graphs
By Josef Cibulka · ArXiv: 0802.1312
2011-02-07
0
Network as a computer: ranking paths to find flows
By Dusko Pavlovic · ArXiv: 0802.1306
2009-04-18
0
On GCD-morphic sequences
By ** M. Dziemiańczyk (Maciek Ciupa) – Institute of Computer Science, Białystok University, 폴란드 W. Bajguz – Institute of Computer Science · ArXiv: 0802.1303
2008-02-13
0
Learning Balanced Mixtures of Discrete Distributions with Small Sample
By Shuheng Zhou · ArXiv: 0802.1244
2008-02-21
0
Minimum Entropy Orientations
By Jean Cardinal, Samuel Fiorini, Gwena"el Joret · ArXiv: 0802.1237
2008-10-28
0
Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
By Qiqi Yan · ArXiv: 0802.1226
2015-07-01
0
Complexity of Decoding Positive-Rate Reed-Solomon Codes
By Qi Cheng, Daqing Wan · ArXiv: 0802.1220
2008-02-12
0
Snap-Stabilization in Message-Passing Systems
By ** Sylvie Delaët, Stéphane Devismes, Mikhail Nesterenko · ArXiv: 0802.1123
2009-09-29
0
Multi-Use Unidirectional Proxy Re-Signatures
By Beno^it Libert, Damien Vergnaud · ArXiv: 0802.1113
2008-02-11
0
Average-Case Analysis of Online Topological Ordering
By Deepak Ajwani, Tobias Friedrich · ArXiv: 0802.1059
2008-02-08
0
An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem
By ** Benjamin Sach, Raphaël Clifford (Bristol University, 영국) ** · ArXiv: 0802.1026
2008-02-08
0
Small Is Not Always Beautiful
By ** Paweł Marciniak (Poznań University of Technology, Pol, ) Nikitas Liogkas (UCLA · ArXiv: 0802.1015
2008-02-08
0
New Estimation Procedures for PLS Path Modelling
By Xavier Bry (I3M) · ArXiv: 0802.1002
2008-02-08
0
«« « 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 » »»