全部 标题 作者
关键词 摘要

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

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

Computer Science

ISSN Print:

ISSN Online:

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

分享:




Go

Maximum Entropy Deep Inverse Reinforcement Learning

Markus Wulfmeier,Peter Ondruska,Ingmar Posner

Sparse Estimation in a Correlated Probit Model

Stephan Mandt,Florian Wenzel,Shinichi Nakajima,John P. Cunningham,Christoph Lippert,Marius Kloft

Application of Kullback-Leibler divergence for short-term user interest detection

Maxim Borisyak,Roman Zykov,Artem Noskov

Non-convex Regularizations for Feature Selection in Ranking With Sparse SVM

Léa Laporte,Rémi Flamary,Stephane Canu,Sébastien Déjean,Josiane Mothe

Task Selection for Bandit-Based Task Assignment in Heterogeneous Crowdsourcing

Hao Zhang,Masashi Sugiyama

True Online Emphatic TD($λ$): Quick Reference and Implementation Guide

Richard S. Sutton

Reduced-Set Kernel Principal Components Analysis for Improving the Training and Execution Speed of Kernel Machines

Hassan A. Kingravi,Patricio A. Vela,Alexandar Gray

Minimum Density Hyperplane: An Unsupervised and Semi-Supervised Classifier

Nicos Pavlidis,David Hofmeyr,Sotiris Tasoulis

Training artificial neural networks to learn a nondeterministic game

Thomas E. Portegys

Rich Component Analysis

Rong Ge,James Zou

Closed Curves and Elementary Visual Object Identification

Manfred Harringer

Deep Recurrent Q-Learning for Partially Observable MDPs

Matthew Hausknecht,Peter Stone

MixEst: An Estimation Toolbox for Mixture Models

Reshad Hosseini,Mohamadreza Mash'al

Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups

Daniel K？nig,Markus Lohrey,Georg Zetzsche

Synchronizing delay for binary uniform morphisms

Karel Klouda,Kate？ina Medková

Revisiting Robustness in Priced Timed Games

Shibashis Guha,Shankara Narayanan Krishna,Lakshmi Manasa,Ashutosh Trivedi

A Three-Dimensional GUI for Windows Explorer

David Carter,Luiz Fernando Capretz

Understanding the Affect of Developers: Theoretical Background and Guidelines for Psychoempirical Software Engineering

Daniel Graziotin,Xiaofeng Wang,Pekka Abrahamsson

Towards Understanding User Preferences from User Tagging Behavior for Personalization

Amandianeze O. Nwana,Tshuan Chen

Unboundedness and Downward Closures of Higher-Order Pushdown Automata

Matthew Hague,Jonathan Kochems,C. -H. Luke Ong

The Tangent Search Engine: Improved Similarity Metrics and Scalability for Math Formula Search

Richard Zanibbi,Kenny Davila,Andrew Kane,Frank Tompa

A Network-Aware Approach for Searching As-You-Type in Social Media (Extended Version)

Paul Lagrée,Bogdan Cautis,Hossein Vahabi

Topical Discovery of Web Content

Giancarlo Crocetti

Filtered Patent Maps for Predicting Diversification Paths of Inventors and Organizations

Bowen Yan,Jianxi Luo

Complexity of Substitutive Sequences - Calculation of the Complexities of Substitutive Sequences Over a Binary Alphabet

Bo Tan,Zhi-Xiong Wen,Yiping Zhang

A theory of probabilistic automata, part 1

Andrew M. Mironov

CamSwarm: Instantaneous Smartphone Camera Arrays for Collaborative Photography

Yan Wang,Jue Wang,Shih-Fu Chang

PanoSwarm: Collaborative and Synchronized Multi-Device Panoramic Photography

Yan Wang,Sunghyun Cho,Jue Wang,Shih-Fu Chang

Anti-Fall: A Non-intrusive and Real-time Fall Detector Leveraging CSI from Commodity WiFi Devices

Daqing Zhang,Hao Wang,Yasha Wang,Junyi Ma

Agglomerative clustering and collectiveness measure via exponent generating function

Wei-Ya Ren,Shuo-Hao Li,Qiang Guo,Guo-Hui Li,Jun Zhang

Budget Constrained Execution of Multiple Bag-of-Tasks Applications on the Cloud

Long Thai,Blesson Varghese,Adam Barker

HT-Ring Paxos: Theory of High Throughput State-Machine Replication for Clustered Data Centers

Vinit Kumar,Ajay Agarwal

Noisy Rumor Spreading and Plurality Consensus

Pierre Fraigniaud,Emanuele Natale

Gene expression modelling across multiple cell-lines with MapReduce

David M. Budden,Edmund J. Crampin

Probabilistic Self-Stabilization

Luca Becchetti,Andrea Clementi,Emanuele Natale,Francesco Pasquale

Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity

Cheng Wang

WearWrite: Orchestrating the Crowd to Complete Complex Tasks from Wearables (We Wrote This Paper on a Watch)

Michael Nebeling,Anhong Guo,Kyle Murray,Annika Tostengard,Angelos Giannopoulos,Martin Mihajlov,Steven Dow,Jaime Teevan,Jeffrey P. Bigham

Algorithmic and enumerative aspects of the Moser-Tardos distribution

David G. Harris,Aravind Srinivasan

Avoidability of long $k$-abelian repetitions

Micha？l Rao,Matthieu Rosenfeld

Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths

Maria Axenovich,Torsten Ueckerdt,Pascal Weiner

Chiminey: Reliable Computing and Data Management Platform in the Cloud

Iman I. Yusuf,Ian E. Thomas,Maria Spichkova,Steve Androulakis,Grischa R. Meyer,Daniel W. Drumm,George Opletal,Salvy P. Russo,Ashley M. Buckle,Heinz W. Schmidt

DART-MPI: An MPI-based Implementation of a PGAS Runtime System

Huan Zhou,Yousri Mhedheb,Kamran Idrees,Colin W. Glass,José Gracia,Karl Fürlinger,Jie Tao

Anonymous Processors with Synchronous Shared Memory

Bogdan S. Chlebus,Gianluca De Marco,Muhammed Talo

Well-Formed Separator Sequences, with an Application to Hypergraph Drawing

René van Bevern,Iyad Kanj,Christian Komusiewicz,Rolf Niedermeier,Manuel Sorge

Sparsity and dimension

Gwena？l Joret,Piotr Micek,Veit Wiechert

An extremal problem in proper $(r,p)$-coloring of hypergraphs

Tapas Kumar Mishra,Sudebkumar Prasant Pal

Blocking optimal $k$-arborescences

Attila Bernáth,Tamás Király

Ordering with precedence constraints and budget minimization

Jeff Kinne,Ján Manuch,Akbar Rafiey,Arash Rafiey

Counting matchings in irregular bipartite graphs and random lifts

Marc Lelarge

Strong $(r,p)$ Cover for Hypergraphs

Tapas Kumar Mishra,Sudebkumar Prasant Pal

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