14515 search results - page 367 / 2903 » Efficient Embedded Computing |
214
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
178
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—We study scalable routing for a sensor network deployed in complicated 3D settings such as underground tunnels in gas system or water system. The nodes are in general 3D space b...
151
click to vote
PODS
2001
ACM
16 years 7 months ago
2001
ACM
A classic result of Johnson and Lindenstrauss asserts that any set of n points in d-dimensional Euclidean space can be embedded into k-dimensional Euclidean space -- where k is lo...
166
click to vote
ICDM
2007
IEEE
16 years 1 months ago
2007
IEEE
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
192
click to vote
COCOON
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...