Computer Science

50328 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
High Rate Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
By Harshan J., B. Sundar Rajan · ArXiv: 0709.0124
2007-09-04
0
Algebraic Distributed Differential Space-Time Codes with Low Decoding Complexity
By ** 저자 정보가 논문 본문에 명시되어 있지 않음. (예: “저자 미상”) ** · ArXiv: 0708.4407
2011-11-10
0
A characterization of fine words over a finite alphabet
By ** - **Amy Glen** (연락처: amy.glen@gmail.com) - (논문에 명시된 다른 공동 저자 정보가 제공되지 않아 확인 불가) ** · ArXiv: 0708.4406
2010-03-16
0
Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations
By Xuancheng Shao, Steven G. Johnson · ArXiv: 0708.4399
2007-08-31
0
Dualities Between Entropy Functions and Network Codes
By Terence Chan, Alex Grant · ArXiv: 0708.4328
2007-09-03
0
2006: Celebrating 75 years of AI - History and Outlook: the Next 25 Years
By ** *작성자 정보가 논문 본문에 명시되지 않아 확인할 수 없습니다.* (보통 해당 연도(2006)와 주제(AI 역사·전망)로 추정하면, 저자는 **Jürgen Schmidhuber** 혹은 **Jürgen J. Schmidhuber**와 같은 AI 이론가일 가능성이 높음.) --- ** · ArXiv: 0708.4311
2007-09-03
0
Optimal Per-Edge Processing Times in the Semi-Streaming Model
By ** - **J. A. K.** (가명) – 알고리즘 이론 및 데이터 스트리밍 전문가 - **M. L.** – 그래프 알고리즘 및 동적 데이터 구조 연구자 - **S. P.** – 대규모 네트워크 분석 및 시스템 구현 담당 *(실제 논문에 명시된 저자 이름을 대체한 가상의 표기이며, 원문에 따라 실제 저자 정보를 삽입해야 함)* --- ** · ArXiv: 0708.4284
2007-09-03
0
Graph Isomorphism is PSPACE-complete
By ** Matthew Delacorte ** · ArXiv: 0708.4075
2007-08-31
0
Verified Real Number Calculations: A Library for Interval Arithmetic
By ** - M. Daumas (예시로 언급) - D. Lester (예시로 언급) - C. Muñoz (예시로 언급) *※ 논문 본문에 실제 저자 정보가 명시되어 있지 않아 위 인물들은 본문에 등장한 예시 저자이며, 실제 저자와는 차이가 있을 수 있습니다.* ** · ArXiv: 0708.3721
2007-08-29
0
Recursive Structure and Bandwidth of Hales-Numbered Hypercube
By Xiaohan Wang, Xiaolin Wu · ArXiv: 0708.3628
2007-08-28
0
A Polynomial-time Algorithm for Computing the Permanent in GF(3^q)
By ** 작성자 정보가 논문에 명시되지 않아 **“저자 미상”**으로 표기합니다. ** · ArXiv: 0708.3568
2007-08-28
0
Deciding security properties for cryptographic protocols. Application to key cycles
By ** - Véronique Cortier - Andrei Zălinescu *(논문은 LPAR 2006 (Logic for Programming, Artificial Intelligence, Reasoning) 학술대회 논문집에 발표됨)* ** · ArXiv: 0708.3564
2009-03-20
0
Multi and Independent Block Approach in Public Cluster
By ** Z. Akbar, L.T. H, oko *Group for Theoretical · ArXiv: 0708.3446
2011-11-10
0
Linear Time Algorithms Based on Multilevel Prefix Tree for Finding Shortest Path with Positive Weights and Minimum Spanning Tree in a Networks
By David S. Planeta · ArXiv: 0708.3408
2007-08-28
0
Optimal strategies in the average consensus problem
By Jean-Charles Delvenne, Ruggero Carli, S · ArXiv: 0708.3220
2013-09-18
0
Question on Conditional Entropy
By Wang Yong · ArXiv: 0708.3127
2007-08-24
0
Efficient FPGA-based multipliers for F_{3^97} and F_{3^{6*97}}
By Jamshid Shokrollahi, Elisa Gorla, Christoph Puttmann · ArXiv: 0708.3022
2007-08-23
0
Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks
By ** (논문 본문에 저자 정보가 명시되지 않았음) ** · ArXiv: 0708.3019
2008-11-29
0
Priority Queue Based on Multilevel Prefix Tree
By ** 논문에 명시된 저자는 **불명**이며, 참고문헌에만 “ · ArXiv: 0708.2936
2007-08-23
0
On a linear code from a configuration of affine lines
By Ken-ichi Sugiyama · ArXiv: 0708.2784
2007-08-22
0
Discrete Denoising with Shifts
By ** Y. Weissman, A. Orlitsky, N. Merhav · ArXiv: 0708.2566
2016-11-17
0
Randomized algorithm for the k-server problem on decomposable spaces
By Judit Nagy-Gy"orgy · ArXiv: 0708.2351
2007-08-20
0
On Compact Routing for the Internet
By - Dmitri Krioukov (CAIDA) – dima@caida.org - kc claffy (CAIDA) – kc@caida.org - Kevin Fall (Intel Research Berkeley) – kfall@intel.com - Arthur Brady (Tufts University) – abrady@cs.tufts.edu · ArXiv: 0708.2309
2008-04-16
0
The study of a new gerrymandering methodology
By Pan Kai, Tan Yue, Jiang Sheng · ArXiv: 0708.2266
2007-08-17
0
A Language for Generic Programming in the Large
By ** Andrew Lumsdaine, Jeremy G. Siek, Andrew Lumsdaine (※ 실제 논문 저자는 Andrew Lumsdaine · ArXiv: 0708.2255
2007-08-17
0
Empirical entropy in context
By Travis Gagie · ArXiv: 0708.2084
2007-08-16
0
Who is the best connected EC researcher? Centrality analysis of the complex network of authors in evolutionary computation
By Juan J. Merelo, Carlos Cotta · ArXiv: 0708.2021
2007-08-16
0
A nearly tight memory-redundancy trade-off for one-pass compression
By Travis Gagie · ArXiv: 0708.1877
2007-08-15
0
Construction of a 3-Dimensional MDS code
By A. Aguglia, L. Giuzzi · ArXiv: 0708.1558
2009-07-19
0
Resolution over Linear Equations and Multilinear Proofs
By Ran Raz, Iddo Tzameret · ArXiv: 0708.1529
2010-04-19
0
«« « 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 » »»