Computer Science - oalib

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

投递稿件

为什么选择我们？ >>

- 开源期刊

- 同行审议

- 快速出刊

- 终身存储

- 免费检索

- 免费推广

- 更多...

- 搜索引擎

Computer Science

ISSN Print:

ISSN Online:

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

分享:

Reinforcement Learning for the Unit Commitment Problem

Gal Dalal,Shie Mannor

Algebraic and model theoretic methods in constraint satisfaction

Michael Pinsker

A Classification of Connected f -factor Problems inside NP

N. S. Narayanaswamy,C. S. Rahul

Learning Action Models: Qualitative Approach

Thomas Bolander,Nina Gierasimczuk

Rewriting recursive aggregates in answer set programming: back to monotonicity

Mario Alviano,Wolfgang Faber,Martin Gebser

Framework for learning agents in quantum environments

Vedran Dunjko,Jacob M. Taylor,Hans J. Briegel

Extending the axioms of inconsistency indices for pairwise comparisons

Matteo Brunelli

Solomonoff Induction Violates Nicod's Criterion

Jan Leike,Marcus Hutter

Revisiting AdaBoost for Cost-Sensitive Classification. Part I: Theoretical Perspective

Iago Landesa-Vázquez,José Luis Alba-Castro

Massively Parallel Methods for Deep Reinforcement Learning

Arun Nair,Praveen Srinivasan,Sam Blackwell,Cagdas Alcicek,Rory Fearon,Alessandro De Maria,Vedavyas Panneershelvam,Mustafa Suleyman,Charles Beattie,Stig Petersen,Shane Legg,Volodymyr Mnih,Koray Kavukcuoglu,David Silver

Exploratory topic modeling with distributional semantics

Samuel R？nnqvist

A Dependency-Based Neural Network for Relation Classification

Yang Liu,Furu Wei,Sujian Li,Heng Ji,Ming Zhou,Houfeng Wang

Bias and population structure in the actuation of sound change

James Kirby,Morgan Sonderegger

Prior Polarity Lexical Resources for the Italian Language

Valeria Borzì,Simone Faro,Arianna Pavone,Sabrina Sansone

Tag-Weighted Topic Model For Large-scale Semi-Structured Documents

Shuangyin Li,Jiefei Li,Guan Huang,Ruiyang Tan,Rong Pan

Classifier-Based Text Simplification for Improved Machine Translation

Shruti Tyagi,Deepti Chopra,Iti Mathur,Nisheeth Joshi

Mining and Analyzing the Future Works in Scientific Articles

Yue Hu,Xiaojun Wan

Learning to Mine Chinese Coordinate Terms Using the Web

Xiaojiang Huang,Xiaojun Wan,Jianguo Xiao

Information-theoretical analysis of the statistical dependencies among three variables: Applications to written language

Damián G. Hernández,Damián H. Zanette,Inés Samengo

A generalised isodiametric problem

Christos Pelekis

Fast Biclustering by Dual Parameterization

P？l Gr？n？s Drange,Felix Reidl,Fernando Sánchez Villaamil,Somnath Sikdar

Flow Rounding

Donggu Kang,James Payor

On the Approximability of Digraph Ordering

Sreyash Kenkre,Vinayaka Pandit,Manish Purohit,Rishi Saket

I/O-Efficient Similarity Join

Rasmus Pagh,Ninh Pham,Francesco Silvestri,Morten St？ckel

Approximating Dense Max 2-CSPs

Pasin Manurangsi,Dana Moshkovitz

Improved Approximations for Cubic and Cubic Bipartite TSP

Anke van Zuylen

Spatial mixing and approximate counting for Potts model on graphs with bounded average degree

Yitong Yin,Chihao Zhang

A Deterministic Algorithm for Maximizing Submodular Functions

Shahar Dobzinski,Ami Mor

Spectral structure of singular spectrum decomposition for time series

Kenji Kume,Naoko Nose-Togawa

Finger Search, Random Access, and Longest Common Extensions in Grammar-Compressed Strings

Philip Bille,Anders Roy Christiansen,Patrick Hagge Cording,Inge Li G？rtz

L infinity Isotonic Regression for Linear, Multidimensional, and Tree Orders

Quentin F. Stout

Directed multicut is W[1]-hard, even for four terminal pairs

Marcin Pilipczuk,Magnus Wahlstr？m

Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm

Niklas Baumstark,Guy Blelloch,Julian Shun

Dynamic Reallocation Problems in Scheduling

Wei Quan Lim,Seth Gilbert,Wei Zhong Lim

Path-Fault-Tolerant Approximate Shortest-Path Trees

Annalisa D'Andrea,Mattia D'Emidio,Daniele Frigioni,Stefano Leucci,Guido Proietti

Space-Efficient Plane-Sweep Algorithms

Amr Elmasry,Frank Kammer

Fast and Simple Computation of Top-k Closeness Centralities

Michele Borassi,Pierluigi Crescenzi,Andrea Marino

Log-Lists and Their Applications to Sorting by Transpositions, Reversals and Block-Interchanges

Irena Rusu

DiffNodesets: An Efficient Structure for Fast Mining Frequent Itemsets

Zhi-Hong Deng

Sorting Networks: to the End and Back Again

Michael Codish,Luís Cruz-Filipe,Thorsten Ehlers,Mike Müller,Peter Schneider-Kamp

Approximate Deadline-Scheduling with Precedence Constraints

Hossein Efsandiari,MohammadTaghi Hajiaghyi,Jochen Koenemann,Hamid Mahini,David Malec,Laura Sanita

Explicit Expanding Expanders

Michael Dinitz,Michael Schapira,Asaf Valadarsky

Typing Regular Path Query Languages for Data Graphs

Dario Colazzo,Carlo Sartiani

Expressive Path Queries on Graph with Data

Pablo Barcelo,Gaelle Fontaine,Anthony Widjaja Lin

Lustre, Hadoop, Accumulo

Jeremy Kepner,William Arcand,David Bestor,Bill Bergeron,Chansup Byun,Lauren Edwards,Vijay Gadepally,Matthew Hubbell,Peter Michaleas,Julie Mullen,Andrew Prout,Antonio Rosa,Charles Yee,Albert Reuther

Structurally Tractable Uncertain Data

Antoine Amarilli

Converting Static Image Datasets to Spiking Neuromorphic Datasets Using Saccades

Garrick Orchard,Ajinkya Jayawant,Gregory Cohen,Nitish Thakor

Estimating the Impact of Unknown Unknowns on Aggregate Query Results

Yeounoh Chung,Michael Lind Mortensen,Carsten Binnig,Tim Kraska

PackageBuilder: From Tuples to Packages

Matteo Brucato,Rahul Ramakrishna,Azza Abouzied,Alexandra Meliou

©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