Computer Science

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

投递稿件

为什么选择我们？ >>

- 开源期刊

- 同行审议

- 快速出刊

- 终身存储

- 免费检索

- 免费推广

- 更多...

- 搜索引擎

Computer Science

ISSN Print:

ISSN Online:

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

Combining Ontology Development Methodologies and Semantic Web Platforms for E-government Domain Ontology Development

Jean Vincent Fonou Dombeu,Magda Huisman

Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression

Sham Kakade,Adam Tauman Kalai,Varun Kanade,Ohad Shamir

Quantum Structure in Cognition: Fundamentals and Applications

Diederik Aerts,Liane Gabora,Sandro Sozzo,Tomas Veloz

Some 0/1 polytopes need exponential size extended formulations

Thomas Rothvo？

The Complexity of Surjective Homomorphism Problems -- a Survey

Manuel Bodirsky,Jan Kara,Barnaby Martin

The Computational Complexity of Disconnected Cut and 2K2-Partition

Barnaby Martin,Daniel Paulusma

Complexity of two-variable Dependence Logic and IF-Logic

Juha Kontinen,Antti Kuusisto,Peter Lohmann,Jonni Virtema

Numbers as Data Structures: The Prime Successor Function as Primitive

Ross D. King

A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application

Gregory Gutin,Mark Jones,Dominik Scheder,Anders Yeo

Storage Enforcement with Kolmogorov Complexity and List Decoding

Mohammad Iftekhar Husain,Steve Ko,Atri Rudra,Steve Uurtamo

Minimization for Generalized Boolean Formulas

Edith Hemaspaandra,Henning Schnoor

On the optimal compression of sets in PSPACE

Marius Zimand

New Hardness Results in Rainbow Connectivity

Prabhanjan Ananth,Meghana Nasre

Materials to the Russian-Bulgarian Comparative Dictionary "EAD"

Yavor Angelov Parvanov

Seeking Meaning in a Space Made out of Strokes, Radicals, Characters and Compounds

Yannis Haralambous

Refined bounds on the number of connected components of sign conditions on a variety

Sal Barone,Saugata Basu

Minimum cell connection and separation in line segment arrangements

Helmut Alt,Sergio Cabello,Panos Giannopoulos,Christian Knauer

Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs

Radoslav Fulek,Noushin Saeedi,Deniz Sarioz

Consistent Labeling of Rotating Maps

Andreas Gemsa,Martin N？llenburg,Ignaz Rutter

Kinetic Stable Delaunay Graphs

Pankaj K. Agarwal,Jie Gao,Leonidas J. Guibas,Haim Kaplan,Vladlen Koltun,Natan Rubin,Micha Sharir

Fast $q$-gram Mining on SLP Compressed Strings

Keisuke Goto,Hideo Bannai,Shunsuke Inenaga,Masayuki Takeda

Connectivity Damage to a Graph by the Removal of an Edge or a Vertex

Charles L. Cartledge,Michael L. Nelson

Gossip PCA

Satish Babu Korada,Andrea Montanari,Sewoong Oh

Analysis of Randomized Work Stealing with False Sharing

Richard Cole,Vijaya Ramachandran

A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs

Ján Katrenic,Gabriel Semanisin

A Matrix Hyperbolic Cosine Algorithm and Applications

Anastasios Zouzias

Self-organized network design by link survivals and shortcuts

Yukio Hayashi,Yuki Meguro

Near-Optimal Column-Based Matrix Reconstruction

Christos Boutsidis,Petros Drineas,Malik Magdon-Ismail

Span-program-based quantum algorithm for the rank problem

Aleksandrs Belovs

Listing All Maximal Cliques in Large Sparse Real-World Graphs

David Eppstein,Darren Strash

Hypergraph Partitioning through Vertex Separators on Graphs

Enver Kayaaslan,Ali Pinar,Umit V. Catalyurek,Cevdet Aykanat

Locating Depots for Capacitated Vehicle Routing

Inge Li Goertz,Viswanath Nagarajan

An exact and O(1) time heaviest and lightest hitters algorithm for sliding-window data streams

Remous-Aris Koutsiamanis,Pavlos S. Efraimidis

Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types

Matthew Rocklin,Ali Pinar

The Grothendieck constant is strictly smaller than Krivine's bound

Mark Braverman,Konstantin Makarychev,Yury Makarychev,Assaf Naor

Sparse Vector Distributions and Recovery from Compressed Sensing

Bob L. Sturm

Colorful Triangle Counting and a MapReduce Implementation

Rasmus Pagh,Charalampos E. Tsourakakis

Constructing and Sampling Graphs with a Prescribed Joint Degree Distribution

Isabelle Stanton,Ali Pinar

The Topology of Wireless Communication

Erez Kantor,Zvi Lotker,Merav Parter,David Peleg

Efficient Resource Oblivious Algorithms for Multicores

Richard Cole,Vijaya Ramachandran

Human-Assisted Graph Search: It's Okay to Ask Questions

Aditya Parameswaran,Anish Das Sarma,Hector Garcia-Molina,Neoklis Polyzotis,Jennifer Widom

Linear pattern matching on sparse suffix trees

Roman Kolpakov,Gregory Kucherov,Tatiana Starikovskaya

Fast Set Intersection in Memory

Bolin Ding,Arnd Christian K？nig

Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration

Martiniano Eguía,Francisco J. Soulignac

Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks

Dennis Schieferdecker,Markus V？lker,Dorothea Wagner

Artificial Neural Network and Rough Set for HV Bushings Condition Monitoring

LJ Mpanza,T. Marwala

A stochastic model for distributed real time streaming - Evolution of the network structure

Andrea Monsellato

An Anti-attack Model Based on Complex Network Theory in P2P networks

Hao Peng,Songnian Lu,Dandan Zhao,Aixin Zhang,Jianhua Li

Sliding Trellis-Based Frame Synchronization

Usman Ali,Pierre Duhamel,Michel Kieffer

Pheromone Static Routing Strategy for Complex Networks

Xiang Ling,Henry Y. K. Lau,Rui Jiang,Mao-Bin Hu