Computer Science

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

投递稿件

为什么选择我们？ >>

- 开源期刊

- 同行审议

- 快速出刊

- 终身存储

- 免费检索

- 免费推广

- 更多...

- 搜索引擎

Computer Science

ISSN Print:

ISSN Online:

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

Packing interval graphs with vertex-disjoint triangles

Ton Kloks

A note on probe cographs

Ton Kloks

Component Coloring of Proper Interval Graphs and Split Graphs

Ajit Diwan,Soumitra Pal,Abhiram Ranade

A Generalization of Multiple Choice Balls-into-Bins: Tight Bounds

Gahyun Park

Finding Weighted Graphs by Combinatorial Search

Jeong Han Kim

A new notion of vertex independence and rank for finite graphs

John Rhodes,Pedro V. Silva

A Note on Interference in Random Point Sets

Luc Devroye,Pat Morin

A simple block representation of reversible cellular automata with time-symmetry

Pablo Arrighi,Vincent Nesme

Improvement on the decay of crossing numbers

Jakub ？erny,Jan Kyn？l,Géza Tóth

Rainbow Induced Subgraphs in Replication Graphs

Marek Szyku？a,Andrzej Kisielewicz

Generating Program Invariants via Interpolation

Marc Moreno Maza,Rong Xiao

Alternatives to the Journal Impact Factor: I3 and the Top-10% (or Top-25%?) of the Most-Highly Cited Papers

Loet Leydesdorff

Technologie et pratiques bibliographiques associées à l'écriture scientifique en milieu universitaire

Gérald Kembellec

Elasticity on Ontology Matching of Folksodriven Structure Network

Massimiliano Dal Mas

Social Contagion: An Empirical Study of Information Spread on Digg and Twitter Follower Graphs

Kristina Lerman,Rumi Ghosh,Tawan Surachawala

Improve the Practice of Software Development in India by Having a Software Development Career Track in Indian CS & IT Academia

Ravi S. Iyer

Magic Knight's Tours in Higher Dimensions

Awani Kumar

On Some Multicolor Ramsey Numbers Involving $K_3+e$ and $K_4-e$

Daniel S. Shetler,Michael A. Wurtz,Stanis？aw P. Radziszowski

Metrics to evaluate research performance in academic institutions: A critique of ERA 2010 as applied in forestry and the indirect H2 index as a possible alternative

Jerome K. Vanclay,Lutz Bornmann

Topological Features of Online Social Networks

Emilio Ferrara,Giacomo Fiumara

Packing of Rigid Spanning Subgraphs and Spanning Trees

Joseph Cheriyan,Olivier Durand de Gevigney,Zoltán Szigeti

Application of Integral Value Transformation (IVT) in a Specialized Computer Network Design

Souvik Naskar,Avishek Ghosh,Pabitra Pal Choudhury

Closed Contour Fractal Dimension Estimation by the Fourier Transform

Jo？o B. Florindo,Odemir M. Bruno

Full Connectivity: Corners, edges and faces

Justin Coon,Carl P. Dettmann,Orestis Georgiou

The existence of fractional repetition codes

Toni Ernvall

Bootstrap Percolation on Random Geometric Graphs

Milan Bradonji？,Iraj Saniee

On the Hyperbolicity of Small-World and Tree-Like Random Graphs

Wei Chen,Wenjie Fang,Guangda Hu,Michael W. Mahoney

Fork-forests in bi-colored complete bipartite graphs

Maria Axenovich,Marcus Krug,Georg Osang,Ignaz Rutter

Implementation of exponential and parametrized algorithms in the AGAPE project

Pascal Berthomé,Jean-Fran？ois Lalande,Vincent Levorato

Faster and Simpler Minimal Conflicting Set Identification

Aida Ouangraoua,Mathieu Raffinot

Mathematical Modeling of the Weaving Structure Design

Krasimir Yordzhev,Hristina Kostadinova

On Identifying Total Effects in the Presence of Latent Variables and Selection bias

Zhihong Cai,Manabu Kuroki

There is no 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem

Gary McGuire,Bastian Tugemann,Gilles Civario

Sensitivity analysis in decision circuits

Debarun Bhattacharjya,Ross D. Shachter

Dynamic Scope-Based Dijkstra's Algorithm

Petr Hlineny,Ondrej Moris

Abstract unordered and ordered trees CRDT

Stéphane Martin,Mehdi Ahmed-Nacer,Pascal Urso

Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract)

Patrick Bindjeme,James Allen Fill

Improving the Accuracy and Efficiency of MAP Inference for Markov Logic

Sebastian Riedel

Query-Subquery Nets

Linh Anh Nguyen,Son Thanh Cao

Model-Based Bayesian Reinforcement Learning in Large Structured Domains

Stephane Ross,Joelle Pineau

Advanced Coarsening Schemes for Graph Partitioning

Ilya Safro,Peter Sanders,Christian Schulz

An Efficient Method for Mining Event-Related Potential Patterns

Seyed Aliakbar Mousavi,Muhammad Rafie Hj Arshad,Hasimah Hj Mohamed,Saleh Ali Alomari

ART : Sub-Logarithmic Decentralized Range Query Processing with Probabilistic Guarantees

Spyros Sioutas,Peter Triantafillou,George Papaloukopoulos,Evangelos Sakkopoulos,Kostas Tsichlas,Yannis Manolopoulos

Identifying reasoning patterns in games

Dimitrios Antos,Avi Pfeffer

New Techniques for Algorithm Portfolio Design

Matthew Streeter,Stephen F. Smith

Bounding Search Space Size via (Hyper)tree Decompositions

Lars Otten,Rina Dechter

Mining Attribute-structure Correlated Patterns in Large Attributed Graphs

Arlei Silva,Wagner Meira Jr.,Mohammed J. Zaki

The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract)

Patrick Bindjeme,James Allen Fill

Faster deterministic integer factorization

Edgar Costa,David Harvey

Nearly Optimal Sparse Fourier Transform

Haitham Hassanieh,Piotr Indyk,Dina Katabi,Eric Price