Computer Science

57093 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
Issues in Stacked Generalization
By K. M. Ting, I. H. Witten · ArXiv: 1105.5466
2011-05-30
0
Learning to Order Things
By ** - **Robert D. Kleinberg** (Cornell University) - **Jon A. McCarthy** (University of Washington) - **J. M. R. Kleinberg** (※ 실제 논문에 따라 저자 명이 다를 수 있음) ** · ArXiv: 1105.5464
2011-05-30
0
Extensible Knowledge Representation: the Case of Description Reasoners
By A. Borgida · ArXiv: 1105.5463
2011-05-30
0
Variational Probabilistic Inference and the QMR-DT Network
By T. S. Jaakkola, M. I. Jordan · ArXiv: 1105.5462
2011-05-30
0
Probabilistic Deduction with Conditional Constraints over Basic Events
By T. Lukasiewicz · ArXiv: 1105.5461
2011-05-30
30
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
By C. Boutilier, T. Dean, S. Hanks · ArXiv: 1105.5460
2011-05-30
0
Solving Highly Constrained Search Problems with Quantum Computers
By T. Hogg · ArXiv: 1105.5459
2011-05-30
0
Cooperation between Top-Down and Bottom-Up Theorem Provers
By ** - *Not provided in the excerpt* (논문에 명시된 저자 정보를 확인 필요) ** · ArXiv: 1105.5458
2011-05-30
0
Efficient Implementation of the Plan Graph in STAN
By M. Fox, D. Long · ArXiv: 1105.5457
2011-05-30
0
Variational Cumulant Expansions for Intractable Distributions
By D. Barber, P. de van Laar · ArXiv: 1105.5455
2011-05-30
0
Complexity of Prioritized Default Logics
By J. Rintanen · ArXiv: 1105.5453
2011-05-30
0
A Counter Example to Theorems of Cox and Fine
By J. Y. Halpern · ArXiv: 1105.5450
2011-05-30
0
Adaptive Parallel Iterative Deepening Search
By D. J. Cook, R. C. Varnell · ArXiv: 1105.5447
2011-05-30
0
A Temporal Description Logic for Reasoning about Actions and Plans
By A. Artale, E. Franconi · ArXiv: 1105.5446
2011-05-30
0
The Gn,m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
By J. Culberson, B. V, egriend · ArXiv: 1105.5443
2011-05-30
0
The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference
By O. Ledeniov, S. Markovitch · ArXiv: 1105.5442
2011-05-30
0
Computational Aspects of Reordering Plans
By C. Backstrom · ArXiv: 1105.5441
2011-05-30
0
The Ariadnes Clew Algorithm
By J. M. Ahuactzin, P. Bessiere, E. Mazer · ArXiv: 1105.5440
2011-05-30
0
Common Edge-Unzippings for Tetrahedra
By Joseph ORourke · ArXiv: 1105.5401
2011-06-09
0
Composition Games for Distributed Systems: the EU Grant games
By ** Shay Kutten, Ron Lavi, Amitabh Trehan ** · ArXiv: 1105.5255
2013-05-21
19
Misleading Stars: What Cannot Be Measured in the Internet?
By Yvonne Anne Pignolet, Stefan Schmid, Gilles Tredan · ArXiv: 1105.5236
2011-06-21
0
Cubicity, Degeneracy, and Crossing Number
By Abhijin Adiga, L. Sunil Ch, ran · ArXiv: 1105.5225
2012-01-31
0
Large-Scale Music Annotation and Retrieval: Learning to Rank in Joint Semantic Spaces
By Jason Weston, Samy Bengio, Philippe Hamel · ArXiv: 1105.5196
2015-03-19
0
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model
By Andreas Galanis, Qi Ge, Daniel Stefankovic · ArXiv: 1105.5131
2013-08-12
0
Robust approachability and regret minimization in games with partial monitoring
By Shie Mannor (EE-Technion), Vianney Perchet (CMLA), Gilles Stoltz (DMA · ArXiv: 1105.4995
2012-02-17
0
Enumerating ODE Equivalent Homogeneous Networks
By Alistair J. Windsor · ArXiv: 1105.4812
2011-05-25
0
Fault-tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation
By Danny Dolev, Matthias Fuegger, Christoph Lenzen · ArXiv: 1105.4780
2015-03-19
0
Online Learning, Stability, and Stochastic Gradient Descent
By Tomaso Poggio, Stephen Voinea, Lorenzo Rosasco · ArXiv: 1105.4701
2015-03-19
0
Bounding the Fat Shattering Dimension of a Composition Function Class Built Using a Continuous Logic Connective
By Hubert Haoyang Duan · ArXiv: 1105.4618
2011-05-25
0
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
By Ch, ra Chekuri, Jan Vondrak · ArXiv: 1105.4593
2014-08-14
0
«« « 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 » »»