813 search results - page 60 / 163 » On the Boolean-Width of a Graph: Structure and Applications |
IPPS
1996
IEEE
14 years 1 months ago
1996
IEEE
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
ATMOS
2007
13 years 10 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
TIT
2010
13 years 3 months ago
2010
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
MOBIQUITOUS
2007
IEEE
14 years 3 months ago
2007
IEEE
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
ICNP
2007
IEEE
14 years 3 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...