1274 search results - page 22 / 255 » Graph lambda theories |
BIRTHDAY
2008
Springer
13 years 10 months ago
2008
Springer
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
ESA
2010
Springer
13 years 10 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
CAD
2007
Springer
13 years 8 months ago
2007
Springer
The reconstruction of a surface model from a point cloud is an important task in the reverse engineering of industrial parts. We aim at constructing a curve network on the point c...
LCTRTS
2009
Springer
14 years 3 months ago
2009
Springer
