全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用：99美元
投递稿件

为什么选择我们？ >>
- 开源期刊
- 同行审议
- 快速出刊
- 终身存储
- 免费检索
- 免费推广
- 更多...
- 搜索引擎

Computer Science

ISSN Print:

ISSN Online:

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

分享:




Go

Applications of Uniform Sampling: Densest Subgraph and Beyond

Hossein Esfandiari,MohammadTaghi Hajiaghayi,David P. Woodruff

Semi-canonical binary matrices

Krasimir Yordzhev

On Euclid's Algorithm and Elementary Number Theory

Roland Backhouse,Jo？o F. Ferreira

Parallel Vectorized Algebraic AES in MATLAB for Rapid Prototyping of Encrypted Sensor Processing Algorithms and Database Analytics

Jeremy Kepner,Vijay Gadepally,Braden Hancock,Peter Michaleas,Elizabeth Michel,Mayank Varia

Fast and Vectorizable Alternatives to Binary Search

Fabio Cannizzo

A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs

Michael Elkin,Seth Pettie

A polynomial kernel for Block Graph Vertex Deletion

Eun Jung Kim,O-joung Kwon

Hadoop Scheduling Base On Data Locality

Bo Jiang,Jiaying Wu,Xiuyu Shi,Ruhuan Huang

CCNCheck: Enabling Checkpointed Distributed Applications in Content Centric Networks

Nitinder Mohan,Pushpendra Singh

Rumor Spreading with Bounded In-Degree

Sebastian Daum,Fabian Kuhn,Yannic Maus

Optimization and analysis of large scale data sorting algorithm based on Hadoop

Zhuo Wang,Longlong Tian,Dianjie Guo,Xiaoming Jiang

Bias vs structure of polynomials in large fields, and applications in effective algebraic geometry and coding theory

Abhishek Bhowmick,Shachar Lovett

Abelian Powers and Repetitions in Sturmian Words

Gabriele Fici,Alessio Langiu,Thierry Lecroq,Arnaud Lefebvre,Filippo Mignosi,élise Prieur-Gaston

Topology-preserving digitization of n-dimensional objects by constructing cubical models

Alexander V. Evako

EMMA: A Resource Oriented Framework for Service Choreography over Wireless Sensor and Actor Networks

Clément Duhart,Pierre Sauvage,Cyrille Bertelle

Machine Learning Based Auto-tuning for Enhanced OpenCL Performance Portability

Thomas L. Falch,Anne C. Elster

Open-Source Simulators for Cloud Computing: Comparative Study and Challenging Issues

Wenhong Tian,Minxian Xu,Aiguo Chen,Guozhong Li,Xinyang Wang,Yu Chen

The implementation and optimization of Bitonic sort algorithm based on CUDA

Qi Mu,Liqing Cui,Yufei Song

Virtual Machine Placement Literature Review

Fabio Lopez-Pires,Benjamin Baran

Exhaustive generation of $k$-critical $\mathcal H$-free graphs

Jan Goedgebeur,Oliver Schaudt

On the Converse of Talagrand's Influence Inequality

Saleet Klein,Amit Levi,Muli Safra,Clara Shikhelman,Yinon Spinka

Non-dominating sequences of vectors using only resets and increments

Wojciech Czerwinski,Tomasz Gogacz,Eryk Kopczynski

On Expansion and Topological Overlap

Dominic Dotterrer,Tali Kaufman,Uli Wagner

Product Construction of Affine Codes

Yeow Meng Chee,Han Mao Kiah,Punarbasu Purkayastha,Patrick Solé

Simultaneously Moving Cops and Robbers

Georgios Konstantinidis,Athanasios Kehagias

Coauthorship and Thematic Networks in AAEP Annual Meetings

Juan M. C. Larrosa

Revealing the online network between University and Industry: The case of Turkey

Enrique Orduna-Malea,Selenay Aytac

Classification of Research Citations (CRC)

Bilal Hayat Butt,Muhammad Rafi,Arsal Jamal,Raja Sami Ur Rehman,Syed Muhammad Zubair Alam,Muhammad Bilal Alam

Amplifying the Impact of Open Access: Wikipedia and the Diffusion of Science

Misha Teplitskiy,Grace Lu,Eamon Duede

Some Extensions of the Inversion Complexity of Boolean Functions

V. V. Kochergin,A. V. Mikhailovich

Approximation with Random Bases: Pro et Contra

Alexander N. Gorban,Ivan Yu. Tyukin,Danil V. Prokhorov,Konstantin I. Sofeikov

Constructive Approach to Automorphism Groups of Planar Graphs

Pavel Klavík,Roman Nedela,Peter Zeman

GraphMaps: Browsing Large Graphs as Interactive Maps

Lev Nachmanson,Roman Prutkin,Bongshin Lee,Nathalie Henry Riche,Alexander E. Holroyd,Xiaoji Chen

A Certified Universal Gathering Algorithm for Oblivious Mobile Robots

Pierre Courtieu,Lionel Rieg,Sébastien Tixeuil,Xavier Urbain

Coresets of obstacles in approximating Euclidean shortest path amid convex obstacles

Rajasekhar Inkulu,Sanjiv Kapoor

Graph drawings with one bend and few slopes

Kolja Knauer,Bartosz Walczak

Point-wise Map Recovery and Refinement from Functional Correspondence

Emanuele Rodolà,Michael Moeller,Daniel Cremers

An elementary approach to tangent space variation on Riemannian submanifolds

Jean-Daniel Boissonnat,Ramsay Dyer,Arijit Ghosh

Upper and Lower Bounds on Long Dual-Paths in Line Arrangements

Udo Hoffmann,Linda Kleist,Tillmann Miltzow

WYSIWYE: An Algebra for Expressing Spatial and Textual Rules for Information Extraction

Vijil Chenthamarakshan,Prasad M Desphande,Raghu Krishnapuram,Ramakrishna Varadarajan,Knut Stolze

Hybridized Feature Extraction and Acoustic Modelling Approach for Dysarthric Speech Recognition

Megha Rughani,D. Shivakrishna

Learning to Transduce with Unbounded Memory

Edward Grefenstette,Karl Moritz Hermann,Mustafa Suleyman,Phil Blunsom

Visualizing and Understanding Recurrent Networks

Andrej Karpathy,Justin Johnson,Li Fei-Fei

Exploiting Text and Network Context for Geolocation of Social Media Users

Afshin Rahimi,Duy Vu,Trevor Cohn,Timothy Baldwin

Author Identification using Multi-headed Recurrent Neural Networks

Douglas Bagnall

Connotation Frames: Typed Relations of Implied Sentiment in Predicate-Argument Structure

Hannah Rashkin,Sameer Singh,Yejin Choi

Scheduled Sampling for Sequence Prediction with Recurrent Neural Networks

Samy Bengio,Oriol Vinyals,Navdeep Jaitly,Noam Shazeer

Non-distributional Word Vector Representations

Manaal Faruqui,Chris Dyer

Editorial for the First Workshop on Mining Scientific Papers: Computational Linguistics and Bibliometrics

Iana Atanassova,Marc Bertin,Philipp Mayr

Parsing Natural Language Sentences by Semi-supervised Methods

Rudolf Rosa

Go




©2008-2020 OALib, Inc | Public user content licensed CC-BY 4.0 unless otherwise specified. OALib ISSN Online: 2333-9721 OALib ISSN Print: 2333-9705