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
Scheduling partially ordered jobs faster than 2^n
By Marek Cygan, Marcin Pilipczuk, Micha{l} Pilipczuk · ArXiv: 1108.0810
2012-07-02
0
Distributed Agreement in Dynamic Peer-to-Peer Networks
By John Augustine, Gopal P, urangan · ArXiv: 1108.0809
2015-03-19
0
Optimization with Sparsity-Inducing Penalties
By Francis Bach (LIENS, INRIA Paris - Rocquencourt), Rodolphe Jenatton (LIENS · ArXiv: 1108.0775
2011-11-24
0
A Fault Tolerant Trajectory Clustering (FTTC) for selecting cluster heads inWireless Sensor Networks
By Hazarath Munaga (Dr MHM Krishna Prasad), J. V. R. Murthy, N. B. Venkateswarlu · ArXiv: 1108.0747
2012-04-01
0
A Hybrid Trajectory Clustering for Predicting User Navigation
By Hazarath Munaga (Dr MHM Krishna Prasad), J. V. R. Murthy, N. B. Venkateswarlu · ArXiv: 1108.0743
2011-08-04
0
Rich-club network topology to minimize synchronization cost due to phase difference among frequency-synchronized oscillators
By Takamitsu Watanabe · ArXiv: 1108.0742
2012-06-25
0
Enhanced User Authentication through Trajectory Clustering
By Hazarath Munaga (Dr MHM Krishna Prasad), J. V. R. Murthy, N. B. Venkateswarlu · ArXiv: 1108.0741
2011-08-04
0
A Novel Trajectory Clustering technique for selecting cluster heads in Wireless Sensor Networks
By Hazarath Munaga, J.V.R. Murthy, N.B.Venkateswarlu · ArXiv: 1108.0740
2011-08-04
0
Policy Creation Model for Policy-Based Management in Telecommunications Networks
By Carlos A. Astudillo, Adriana M. Gustin, Oscar J. Calderon · ArXiv: 1108.0716
2011-08-04
0
QMA variants with polynomially many provers
By Sevag Gharibian, Jamie Sikora, Sarvagya Upadhyay · ArXiv: 1108.0617
2013-01-16
0
Proposal for improvement in the transfer and execution of multiple instances of a virtual image
By Tomas Ramirez Picarzo, Francisco Fern, ez de Vega · ArXiv: 1108.0599
2011-08-03
0
A Group Signature Based Electronic Toll Pricing System
By Xihui Chen, Gabriele Lenzini, Sjouke Mauw · ArXiv: 1108.0574
2011-09-06
1
On Berrys conjectures about the stable order in PCF
By Fritz M"uller (Saarl, University) · ArXiv: 1108.0556
2015-07-01
0
Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval
By Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan · ArXiv: 1108.0554
2012-04-03
0
An Efficient Real Time Method of Fingertip Detection
By Jagdish Lal Raheja, Karen Das, Ankit Chaudhary · ArXiv: 1108.0502
2015-03-13
22
Spatial Dynamic Structures and Mobility in Computation
By Bogdan Aman · ArXiv: 1108.0496
2011-08-11
0
High-Performance Pseudo-Random Number Generation on Graphics Processing Units
By Nimalan N, apalan, Richard P. Brent · ArXiv: 1108.0486
2013-03-13
0
Specifying and Staging Mixed-Initiative Dialogs with Program Generation and Transformation
By Saverio Perugini · ArXiv: 1108.0476
2015-12-22
1
Contracts in distributed systems
By Massimo Bartoletti (Dipartimento di Matematica e Informatica, Universita degli Studi di Cagliari, Italy) · ArXiv: 1108.0471
2011-08-03
0
Amending Contracts for Choreographies
By Laura Bocchi (Department of Computer Science, University of Leicester), Julien Lange (Department of Computer Science · ArXiv: 1108.0470
2011-08-03
0
On the reaction time of some synchronous systems
By Ilias Garnier (CEA LIST), Christophe Aussagu`es (CEA LIST), Vincent David (CEA LIST) · ArXiv: 1108.0467
2011-08-03
0
Polymorphic Endpoint Types for Copyless Message Passing
By Viviana Bono (Torino, Italy), Luca Padovani (Torino · ArXiv: 1108.0466
2011-08-03
0
Structured Operational Semantics for Graph Rewriting
By ** - Andrei Dorman (Dip. di Filosofia, Università Roma Tre; LIPN – UMR 7030, Université Paris 13) – · ArXiv: 1108.0465
2011-08-03
0
Interaction and observation, categorically
By Vincenzo Ciancia · ArXiv: 1108.0464
2011-08-03
0
Innocent strategies as presheaves and interactive equivalences for CCS
By Tom Hirschowitz (CNRS, Chambery), Damien Pous (CNRS · ArXiv: 1108.0463
2011-08-03
0
Sparse Recovery with Graph Constraints: Fundamental Limits and Measurement Construction
By Meng Wang, Weiyu Xu, Enrique Mallada · ArXiv: 1108.0443
2011-08-03
0
A Methodology for assessing Agile Software Development Approaches
By Shvetha Soundararajan · ArXiv: 1108.0427
2011-08-03
0
Algorithmic complexity of pair cleaning method for k-satisfiability problem. (draft version)
By Sergey Kardash · ArXiv: 1108.0408
2012-06-01
0
Exploiting Agent and Type Independence in Collaborative Graphical Bayesian Games
By Frans A. Oliehoek, Shimon Whiteson, Matthijs T.J. Spaan · ArXiv: 1108.0404
2014-04-28
0
A Comprehensive Study of an Online Packet Scheduling Algorithm
By Fei Li · ArXiv: 1108.0388
2011-08-02
0
«« « 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 » »»