1730 search results - page 136 / 346 » Open Archiving for Open Research |
126
click to vote
JGAA
2006
15 years 4 months ago
2006
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
140
click to vote
ML
2008
ACM
15 years 4 months ago
2008
ACM
In this paper, we pose a novel research problem for machine learning that involves constructing a process model from continuous data. We claim that casting learned knowledge in ter...
163
click to vote
ADHOC
2005
15 years 4 months ago
2005
This paper describes the issue of piconet interconnection for Bluetooth technology. These larger networks, known as scatternets, have the potential to increase networking flexibil...
121
click to vote
CCE
2004
15 years 4 months ago
2004
Design process excellence is considered a major differentiating factor between competing enterprises since it determines the constraints within which plant operation and supply ch...
178
click to vote
GC
2010
Springer
15 years 3 months ago
2010
Springer
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...