全部 标题 作者
关键词 摘要

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

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

Computer Science

ISSN Print:

ISSN Online:

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

分享:




Go

Maximizing Barrier Coverage Lifetime with Mobile Sensors

Amotz Bar-Noy,Dror Rawitz,Peter Terlecky

Fixed-parameter algorithms for minimum cost edge-connectivity augmentation

Dániel Marx,László A. Végh

Revisiting Asynchronous Linear Solvers: Provable Convergence Rate Through Randomization

Haim Avron,Alex Druinsky,Anshul Gupta

Detecting regularities on grammar-compressed strings

Tomohiro I,Wataru Matsubara,Kouji Shimohira,Shunsuke Inenaga,Hideo Bannai,Masayuki Takeda,Kazuyuki Narisawa,Ayumi Shinohara

Finding Short Paths on Polytopes by the Shadow Vertex Algorithm

Tobias Brunsch,Heiko R？glin

Power-efficient Assignment of Virtual Machines to Physical Machines

Jordi Arjona Aroca,Antonio Fernandez Anta,Miguel A. Mosteiro,Christopher Thraves,Lin Wang

Improved Approximation Algorithms for the Min-Max Selecting Items Problem

Benjamin Doerr

NP-Hardness of Speed Scaling with a Sleep State

Gunjan Kumar,Saswata Shannigrahi

Combining Binary Search Trees

Erik D. Demaine,John Iacono,Stefan Langerman,？zgür ？zkan

Personalized PageRank to a Target Node

Peter Lofgren,Ashish Goel

On the Approximation of Submodular Functions

Nikhil R. Devanur,Shaddin Dughmi,Roy Schwartz,Ankit Sharma,Mohit Singh

Polar Codes: Speed of polarization and polynomial gap to capacity

Venkatesan Guruswami,Patrick Xia

A New Perspective on Vertex Connectivity

Keren Censor-Hillel,Mohsen Ghaffari,Fabian Kuhn

Online Makespan Minimization with Parallel Schedules

Susanne Albers,Matthias Hellwig

Tighter Upper Bounds for the Minimum Number of Calls and Rigorous Minimal Time in Fault-Tolerant Gossip Schemes

V. H. Hovnanyan,H. E. Nahapetyan,Su. S. Poghosyan,V. S. Poghosyan

An optimal lower bound for monotonicity testing over hypergrids

Deeparnab Chakrabarty,C. Seshadhri

Compact q-gram Profiling of Compressed Strings

Philip Bille,Patrick Hagge Cording,Inge Li G？rtz

A Nonmonotone Analysis with the Primal-Dual Approach: online routing of virtual circuits with unknown durations

Guy Even,Moti Medina

Co-Scheduling Algorithms for High-Throughput Workload Execution

Guillaume Aupy,Manu Shantharam,Anne Benoit,Yves Robert,Padma Raghavan

Tree Compression with Top Trees

Philip Bille,Inge Li Goertz,Gad M. Landau,Oren Weimann

Counting small cuts in a graph

Barbara Geissmann,Rastislav ？rámek

Improved approximation for 3-dimensional matching via bounded pathwidth local search

Marek Cygan

Top-K Product Design Based on Collaborative Tagging Data

Mahashweta Das,Gautam Das,Vagelis Hristidis

Optimal Planar Orthogonal Skyline Counting Queries

Gerth St？lting Brodal,Kasper Green Larsen

Improved ARV Rounding in Small-set Expanders and Graphs of Bounded Threshold Rank

Shayan Oveis Gharan,Luca Trevisan

Analytic Samplers and the Combinatorial Rejection Method

Olivier Bodini,Jérémie Lumbroso,Nicolas Rolin

Balanced offline allocation of weighted balls into bins

？mer Demirel,Ivo F. Sbalzarini

Backward Path Growth for Efficient Mobile Sequential Recommendation

Jianbin Huang,Xuejun Huangfu,Heli Sun,Hong Cheng,Qinbao Song

A Probabilistic Algorithm for Reducing Broadcast Redundancy in Ad Hoc Wireless Networks

Md. Nazrul Islam,M. M. A. Hashem,A. M. Moshiur Rahman

An Improved GEF Fast Addition Algorithm

Md. Mizanur Rahman,Md. Shahadat Hossain,Md. Rakib Hasan,M. M. A. Hashem

RITA: An Index-Tuning Advisor for Replicated Databases

Quoc Trung Tran,Ivo Jimenez,Rui Wang,Neoklis Polyzotis,Anastasia Ailamaki

Traitement approximatif des requêtes flexibles avec groupement d'attributs et jointure

Minyar Sassi-Hidri,Soukaina Ben Bdira

On the Complexity of Query Answering under Matching Dependencies for Entity Resolution

Leopoldo Bertossi,Jaffer Gardezi

Learning and Verifying Quantified Boolean Queries by Example

Azza Abouzied,Dana Angluin,Christos Papadimitriou,Joseph M. Hellerstein,Avi Silberschatz

The case for caution in predicting scientists' future impact

Orion Penner,Raj K. Pan,Alexander M. Petersen,Santo Fortunato

Coauthorship and citation in scientific publishing

Travis Martin,Brian Ball,Brian Karrer,M. E. J. Newman

Analysis of bibliometric indicators for individual scholars in a large data set

Filippo Radicchi,Claudio Castellano

Collective allocation of science funding: from funding agencies to scientific agency

Johan Bollen,David Crandall,Damion Junk,Ying Ding,Katy Boerner

Making Math Searchable in Wikipedia

Moritz Schubotz

Mapping EINS -- An exercise in mapping the Network of Excellence in Internet Science

Almila Akdag Salah,Sally Wyatt,Samir Passi,Andrea Scharnhorst

Genericity versus expressivity - an exercise in semantic interoperable research information systems for Web Science

Christophe Guéret,Tamy Chambers,Linda Reijnhoudt,Frank van der Most,Andrea Scharnhorst

A Two-Dimensional Approach to Evaluate the Scientific Production of Countries (Case Study: The Basic Sciences)

Ammar Nejati,Seyyed Mehdi Hosseini Jenab

Assessing Visualization Techniques for the Search Process in Digital Libraries

Wilko van Hoek,Philipp Mayr

Google Scholar and the h-index in biomedicine: the popularization of bibliometric asessment

Alvaro Cabezas-Clavijo,Emilio Delgado Lopez-Cozar

Semantic Tagging on Historical Maps

Bernhard Haslhofer,Werner Robitza,Carl Lagoze,Francois Guimbretiere

Maps of Computer Science

Daniel Fried,Stephen G. Kobourov

Relative Positions of Countries in the World of Science

Seyyed Mehdi Hosseini Jenab,Ammar Nejati

Comparing journals from different fields of Science and Social Science through a JCR Subject Categories Normalized Impact Factor

Pablo Dorta-Gonzalez,Maria Isabel Dorta-Gonzalez

Central indexes to the citation distribution: A complement to the h-index

Pablo Dorta-Gonzalez,Maria Isabel Dorta-Gonzalez

How important tasks are performed: peer review

T. Hartonen,M. J. Alava

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