Sciweavers

2612 search results - page 387 / 523
» Switching Graphs and Their Complexity
Sort
View
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 10 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...
CORR
2007
Springer
98views Education» more  CORR 2007»
14 years 10 months ago
Normalisation Control in Deep Inference Via Atomic Flows
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
Alessio Guglielmi, Tom Gundersen
JCP
2006
91views more  JCP 2006»
14 years 10 months ago
The Matching Predicate and a Filtering Scheme Based on Matroids
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...
DPD
2007
84views more  DPD 2007»
14 years 10 months ago
Disseminating dependent data in wireless broadcast environments
In wireless mobile environments, data broadcasting is an effective approach to disseminate information to mobile clients. In some applications, the access pattern of all the data c...
Chuan-Ming Liu, Kun-Feng Lin
PE
2006
Springer
127views Optimization» more  PE 2006»
14 years 10 months ago
Cycloid: A constant-degree and lookup-efficient P2P overlay network
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(lo...
Haiying Shen, Cheng-Zhong Xu, Guihai Chen