Computer Science

57259 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
Acquiring Word-Meaning Mappings for Natural Language Interfaces
By C. Thompson · ArXiv: 1106.4571
2011-06-24
0
Competitive Safety Analysis: Robust Decision-Making in Multi-Agent Systems
By M. Tennenholtz · ArXiv: 1106.4570
2011-06-24
0
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
By M. Fox, D. Long · ArXiv: 1106.4561
2011-06-24
0
Learning When Training Data are Costly: The Effect of Class Distribution on Tree Induction
By F. Provost, G. M. Weiss · ArXiv: 1106.4557
2011-06-24
0
Sub-Nyquist Sampling: Bridging Theory and Practice
By Moshe Mishali, Yonina C. Eldar · ArXiv: 1106.4514
2015-03-19
1
Fast Isomorphism Testing of Graphs with Regularly-Connected Components
By Jose Luis Lopez-Presa, Antonio Fern, ez Anta · ArXiv: 1106.4489
2011-06-23
4
Interesting Multi-Relational Patterns
By Eirini Spyropoulou, Tijl De Bie · ArXiv: 1106.4475
2011-09-13
0
Development of mechanism for enhancing data security in quantum cryptography
By ** Ajit Singh¹, Nidhi Sharma² ¹ Department of Computer Science & Engineering, Information Technology · ArXiv: 1106.4469
2011-06-23
0
Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments
By Robert Crowston, Gregory Gutin, Mark Jones · ArXiv: 1106.4454
2011-11-24
24
Space Lower Bounds for Online Pattern Matching
By Raphael Clifford, Markus Jalsenius, Ely Porat · ArXiv: 1106.4412
2011-06-23
0
Logic circuits from zero forcing
By Daniel Burgarth, Vittorio Giovannetti, Leslie Hogben · ArXiv: 1106.4403
2017-01-12
0
Tight Measurement Bounds for Exact Recovery of Structured Sparse Signals
By ** - Nikhil Rao (University of Wisconsin‑Madison, Dept. of Electrical, Computer Engineering) - Benjamin Recht (University of Wisconsin‑Madison · ArXiv: 1106.4355
2011-10-19
0
Average-Consensus Algorithms in a Deterministic Framework
By Kevin Topley, Vikram Krishnamurthy · ArXiv: 1106.4346
2011-06-23
0
Continuum Limits of Markov Chains with Application to Network Modeling
By Yang Zhang, Edwin K. P. Chong, Jan Hannig · ArXiv: 1106.4288
2011-06-22
1
Multi-receiver Wiretap Channel with Public and Confidential Messages
By Ersen Ekrem, Sennur Ulukus · ArXiv: 1106.4286
2011-06-22
1
An optimal quantum algorithm to approximate the mean and its application for approximating the median of a set of points over an arbitrary distance
By Gilles Brassard, Frederic Dupuis, Sebastien Gambs · ArXiv: 1106.4267
2011-06-22
0
Learning with the Weighted Trace-norm under Arbitrary Sampling Distributions
By Rina Foygel, Ruslan Salakhutdinov, Ohad Shamir · ArXiv: 1106.4251
2011-06-23
1
On the gap between ess(f) and cnf_size(f)
By Lisa Hellerstein, Devorah Kletenik · ArXiv: 1106.4247
2011-06-22
0
Understanding opinions. A cognitive and formal account
By Francesca Giardini, Walter Quattrociocchi, Rosaria Conte · ArXiv: 1106.4221
2011-06-22
0
Rooting opinions in the minds: a cognitive model and a formal account of opinions and their dynamics
By Francesca Giardini, Walter Quattrociocchi, Rosaria Conte · ArXiv: 1106.4218
2011-06-22
1
A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism
By Erlin Yao, Mingyu Chen, Rui Wang · ArXiv: 1106.4213
2011-06-22
0
A Novel Attack against Android Phones
By Michael Backes, Sebastian Gerling, Philipp von Styp-Rekowsky · ArXiv: 1106.4184
2011-06-22
28
Complexity Classes and Theories for the Comparator Circuit Value Problem
By Stephen A. Cook, Dai Tri Man Le, Yuli Ye · ArXiv: 1106.4142
2011-10-06
0
Kernel Bounds for Path and Cycle Problems
By Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch · ArXiv: 1106.4141
2015-03-19
3
Decidability of Existence and Construction of a Complement of a given Function
By Ka.Shrinivaasan · ArXiv: 1106.4102
2014-07-31
0
Concurrent Scheduling of Event-B Models
By Pontus Bostr"om, Fredrik Degerlund, Kaisa Sere · ArXiv: 1106.4100
2011-06-22
1
Perspicuity and Granularity in Refinement
By Eerke Boiten (School of Computing, University of Kent) · ArXiv: 1106.4099
2011-06-22
0
A CSP Account of Event-B Refinement
By Steve Schneider (University of Surrey), Helen Treharne (University of Surrey), Heike Wehrheim (University of Paderborn) · ArXiv: 1106.4098
2011-06-22
0
Formalising the Continuous/Discrete Modeling Step
By Richard Banach (University of Manchester, UK), Huibiao Zhu (East China Normal University · ArXiv: 1106.4097
2011-06-22
0
Model exploration and analysis for quantitative safety refinement in probabilistic B
By ** Ukachukwu Ndukwu (Macquarie University) Annabelle McIver (Macquarie University) ** · ArXiv: 1106.4096
2011-06-22
0
«« « 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 » »»