Computer Science

OALib Journal期刊
ISSN: 2333-9721
费用：99美元

投递稿件

为什么选择我们？ >>

- 开源期刊

- 同行审议

- 快速出刊

- 终身存储

- 免费检索

- 免费推广

- 更多...

- 搜索引擎

Computer Science

ISSN Print:

ISSN Online:

主页: http://arxiv.org/corr

Through Wall People Localization Exploiting Radio Windows

Arijit Banerjee,Dustin Maas,Maurizio Bocca,Neal Patwari,Sneha Kasera

On Randomized Sensing and Access Schemes in Wireless Ad-Hoc Cognitive Networks

Armin Banaei,Costas N. Georghiades

Relaying Technologies for Smart Grid Communications

Hongjian Sun,Bo Tan,Jing Jiang,John S. Thompson,Arumugam Nallanathan,H. Vincent Poor

Secret Key Cryptosystem based on Polar Codes over Binary Erasure Channel

Reza Hooshmand,Masoumeh Koochak Shooshtari,Mohammad Reza Aref

Study of Encryption and Decryption of Wave File in Image Formats

Rahul R Upadhyay

Towards Securing APIs in Cloud Computing

Kumar Gunjan,R. K. Tiwari,G. Sahoo

Distinguisher-Based Attacks on Public-Key Cryptosystems Using Reed-Solomon Codes

Alain Couvreur,Philippe Gaborit,Valérie Gauthier-Uma？a,Ayoub Otmani,Jean-Pierre Tillich

A cryptographic image encryption technique for facial-blurring of images

Quist-Aphetsi Kester

Protecting Anti-virus Programs From Viral Attacks

Umakant Mishra

A Case of Collusion: A Study of the Interface Between Ad Libraries and their Apps

Theodore Book,Dan S. Wallach

A Hybrid Cryptosystem Based On Vigenere Cipher and Columnar Transposition Cipher

Quist-Aphetsi Kester

Policy as Types

Lucius G Meredith,Mike Stay,Sophia Drossopoulou

Real-time Peer-to-Peer Botnet Detection Framework based on Bayesian Regularized Neural Network

Sharath Chandra Guntuku,Pratik Narang,Chittaranjan Hota

A Bit of Secrecy for Gaussian Source Compression

Eva C. Song,Paul Cuff,H. Vincent Poor

A Review of Machine Learning based Anomaly Detection Techniques

Harjinder Kaur,Gurpreet Singh,Jaspreet Minhas

Pipage Rounding, Pessimistic Estimators and Matrix Concentration

Nicholas J. A. Harvey,Neil Olver

Polynomial time approximation schemes for the traveling repairman and other minimum latency problems

René Sitters

Minimax Optimal Algorithms for Unconstrained Linear Optimization

H. Brendan McMahan

Network Decontamination with a Single Agent

Yessine Daadaa,Asif Jamshed,Mudassir Shabbir

A Time Series Forest for Classification and Feature Extraction

Houtao Deng,George Runger,Eugene Tuv,Martyanov Vladimir

Online Regret Bounds for Undiscounted Continuous Reinforcement Learning

Ronald Ortner,Daniil Ryabko

Relative Errors for Deterministic Low-Rank Matrix Approximations

Mina Ghashami,Jeff M. Phillips

On NP-Hardness of the Paired de Bruijn Sound Cycle Problem

Evgeny Kapun,Fedor Tsarev

Better Approximation Bounds for the Joint Replenishment Problem

Marcin Bienkowski,Jaroslaw Byrka,Marek Chrobak,？ukasz Je？,Ji？í Sgall

Greedy Online Bipartite Matching on Random Graphs

Andrew Mastin,Patrick Jaillet

Generalization Guarantees for a Binary Classification Framework for Two-Stage Multiple Kernel Learning

Purushottam Kar

An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints

Ahmed Abousamra,David P. Bunde,Kirk Pruhs

Sparse Multiple Kernel Learning with Geometric Convergence Rate

Rong Jin,Tianbao Yang,Mehrdad Mahdavi

Exact Sparse Recovery with L0 Projections

Ping Li,Cun-Hui Zhang

Clustering of Complex Networks and Community Detection Using Group Search Optimization

G. Kishore Kumar,V. K. Jayaraman

A game-theoretic framework for classifier ensembles using weighted majority voting with local accuracy estimates

Harris V. Georgiou,Michael E. Mavroforakis

Domain Specific Hierarchical Huffman Encoding

K. Ilambharathi,G. S. N. V. Venkata Manik,N. Sadagopan,B. Sivaselvan

Improved Accuracy of PSO and DE using Normalization: an Application to Stock Price Prediction

Savinderjit Kaur,Veenu Mangat

On string matching with k mismatches

Marius Nicolae,Sanguthevar Rajasekaran

Lempel-Ziv Parsing in External Memory

Juha K？rkk？inen,Dominik Kempa,Simon J. Puglisi

Dynamic Decremental Approximate Distance Oracles with $(1+ε, 2)$ stretch

Ittai Abraham,Shiri Chechik

Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods

Oliver G？bel,Martin Hoefer,Thomas Kesselheim,Thomas Schleiden,Berthold V？cking

An Approach Finding Frequent Items In Text Or Transactional Data Base By Using BST To Improve The Efficiency Of Apriori Algorithm

P Vasanth Sena

From Landscape to Portrait: A New Approach for Outlier Detection in Load Curve Data

Guoming Tang,Kui Wu,Jingsheng Lei,Zhongqin Bi,Jiuyang Tang

The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online

Albert Gu,Anupam Gupta,Amit Kumar

Optimal Top-k Document Retrieval

Gonzalo Navarro,Yakov Nekrich

Approximating the minimum cycle mean

Krishnendu Chatterjee,Monika Henzinger,Sebastian Krinninger,Veronika Loitzenbauer

Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints

Kook Jin Ahn,Sudipto Guha

Packing a Knapsack of Unknown Capacity

Yann Disser,Max Klimm,Nicole Megow,Sebastian Stiller

An Efficient Multiplication Algorithm Using Nikhilam Method

Shri Prakash Dwivedi

The technique of in-place associative sorting

A. Emre Cetin

Ranking with Diverse Intents and Correlated Contents

Jian Li,Zeyu Zhang

Dynamic Data Structure for Tree-Depth Decomposition

Zdenek Dvorak,Martin Kupec,Vojtech Tuma

Optimally Approximating the Coverage Lifetime of Wireless Sensor Networks

Vivek Kumar Bagaria,Ashwin Pananjady,Rahul Vaze

Flow-Based Algorithms for Local Graph Clustering

Lorenzo Orecchia,Zeyuan Allen Zhu