515 search results - page 16 / 103 » context 2011 |
73
Voted
JCT
2011
14 years 4 months ago
2011
Given a simple graph G, the graph associahedron KG is a simple polytope whose face poset is based on the connected subgraphs of G. This paper defines and constructs graph associah...
190
click to vote
AAECC
2011
Springer
14 years 4 months ago
2011
Springer
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman’s algorithm. Algebra...
OKCON
2011
14 years 11 days ago
2011
This paper describes a new theory of peer-to-peer learning and teaching that we call paragogy. Paragogy's principles were developed by adapting the Knowles's principles...
146
Voted
CONTEXT
2011
Springer
13 years 9 months ago
2011
Springer
Pervasive computing envisions implicit interaction between people and their intelligent environments instead of individual devices, inevitably leading to groups of individuals inte...
63
Voted
JSYML
2011
14 years 4 months ago
2011
We prove that for every Σ0 2 enumeration degree b there exists a noncuppable Σ0 2 degree a > 0e such that b ≤e a and a ≤e b . This allows us to deduce, from results on the...