Computer Science

56274 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
Learning for Dynamic subsumption
By - 저자 정보가 논문 본문에 명시되어 있지 않음. (제공된 텍스트에 저자명 및 소속이 포함되지 않음) · ArXiv: 0904.0029
2009-04-02
0
Stochastic Models of User-Contributory Web Sites
By ** - Tad Hogg (Hewlett‑Packard Laboratories) - Kristina Lerman (USC Information Sciences Institute) ** · ArXiv: 0904.0016
2009-10-06
0
Asymptotically almost all lambda-terms are strongly normalizing
By Rene David (LAMA), Katarzyna Grygiel, Jakub Kozic · ArXiv: 0903.5505
2019-03-14
0
Regret and Jeffreys Integrals in Exp. Families
By Peter Grunwald, Peter Harremoes · ArXiv: 0903.5399
2009-03-31
0
Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
By - **G. Brünnler** (주요 저자, 딥 인퍼런스 분야 선도 연구자) - **A. Guglielmi** (딥 인퍼런스와 원자 흐름 창시자) - **L. Jeřábek** (퀘이즈다항식 컷 제거 초기 결과 제공) - **M. Das** (임계 공식 응용 연구) *(※ 실제 논문 저자 명단은 원문을 확인해 주세요.)* ### · ArXiv: 0903.5392
2017-01-11
0
Unspecified distribution in single disorder problem
By Wojciech Sarnowski, Krzysztof Szajowski · ArXiv: 0903.5341
2020-11-17
1
A Stochastic View of Optimal Regret through Minimax Duality
By Jacob Abernethy, Alekh Agarwal, Peter L. Bartlett · ArXiv: 0903.5328
2009-04-01
0
Sequences close to periodic
By An. A. Muchnik, Yu. L. Pritykin, A. L. Semenov · ArXiv: 0903.5316
2015-05-13
0
A System of Interaction and Structure IV: The Exponentials and Decomposition
By ** - **Lutz Straßburger** – INRIA Saclay–Île‑de‑France, École Polytechnique, France - **Alessio Guglielmi** – University of Bath · ArXiv: 0903.5259
2022-07-01
1
Generalised Proof-Nets for Compact Categories with Biproducts
By ** 논문에 명시된 저자는 **Duncan**(주 저자)와 **Abramsky**(공동 저자) 등이며, 구체적인 소속은 논문 본문에 따로 기재되지 않았다. (※ 실제 논문에서는 저자명과 소속이 명시되어 있을 것으로 예상된다.) --- ** · ArXiv: 0903.5154
2009-03-31
0
Modified-CS: Modifying Compressive Sensing for Problems with Partially Known Support
By Namrata Vaswani, Wei Lu · ArXiv: 0903.5066
2015-03-13
0
Analysis Paralysis: when to stop?
By Er.Akshay Bhardwaj · ArXiv: 0903.5024
2009-03-31
0
Time manipulation technique for speeding up reinforcement learning in simulations
By Petar Kormushev, Kohei Nomoto, Fangyan Dong · ArXiv: 0903.4930
2009-03-28
0
Extensible Component Based Architecture for FLASH, A Massively Parallel, Multiphysics Simulation Code
By ** 논문에 명시된 정확한 저자 목록은 제공되지 않았으나, 본 논문은 주로 **A. Antypas**, **B. Fryxell** · ArXiv: 0903.4875
2014-09-10
0
New Linear Codes from Matrix-Product Codes with Polynomial Units
By Fern, o Hern, o · ArXiv: 0903.4826
2024-05-01
0
Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions
By B.-M. Bui-Xuan, J. A. Telle, M. Vatshelle (Department of Informatics · ArXiv: 0903.4796
2011-03-10
0
Guaranteed Minimum Rank Approximation from Linear Observations by Nuclear Norm Minimization with an Ellipsoidal Constraint
By ** - 원저자: *Recht, Fazel, Parrilo* (원 논문) - 현재 분석 논문 저자: (논문 본문에 명시되지 않음) → **저자 정보 미제공** ** · ArXiv: 0903.4742
2009-03-30
0
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
By 논문에 명시된 저자 정보는 제공되지 않았습니다. (원문에 저자 명단이 포함되지 않음) · ArXiv: 0903.4728
2011-10-10
0
Fountain Codes and Invertible Matrices
By Mikko Malinen · ArXiv: 0903.4554
2009-03-26
0
Random Linear Network Coding for Time-Division Duplexing: Queueing Analysis
By Daniel E. Lucani, Muriel Medard, Milica Stojanovic · ArXiv: 0903.4434
2009-03-26
0
Capacity Scaling Laws for Underwater Networks
By Daniel E. Lucani, Muriel Médard, Milica Stojanovic · ArXiv: 0903.4426
2009-03-25
0
Towards a decentralized algorithm for mapping network and computational resources for distributed data-flow computations
By Shah Asaduzzaman, Muthucumaru Maheswaran · ArXiv: 0903.4392
2009-03-25
0
Using Dedicated and Opportunistic Networks in Synergy for a Cost-effective Distributed Stream Processing Platform
By Shah Asaduzzaman, Muthucumaru Maheswaran · ArXiv: 0903.4378
2016-11-17
0
Design of Log-Map / Max-Log-Map Decoder
By Mihai Timis · ArXiv: 0903.4298
2009-03-26
1
Conditional Probability Tree Estimation Analysis and Algorithms
By Alina Beygelzimer, John Langford, Yuri Lifshits · ArXiv: 0903.4217
2009-06-04
0
Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
By ** 논문에 명시된 저자 정보가 본문에 포함되지 않아 정확히 파악할 수 없습니다. (원문에 저자 명단이 누락된 것으로 보입니다.) ** · ArXiv: 0903.4101
2009-03-25
0
Optimized Implementation of Elliptic Curve Based Additive Homomorphic Encryption for Wireless Sensor Networks
By ** 논문에 명시된 저자 정보는 제공되지 않았습니다. (원문에 저자명 및 소속이 누락되어 있음) ** · ArXiv: 0903.3900
2009-03-24
2
Personal report of the 3rd ECMDA-FA07 conference
By Beno^it Combemale (IRIT) · ArXiv: 0903.3797
2009-03-24
0
Notes on solving and playing peg solitaire on a computer
By George I. Bell · ArXiv: 0903.3696
2014-11-07
1
Comment on "Language Trees and Zipping" arXiv:cond-mat/0108530
By Xiuli Wang · ArXiv: 0903.3669
2009-03-24
0
«« « 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 » »»