1327 search results - page 193 / 266 » Path following algorithm for the graph matching problem |
90
Voted
WG
2000
Springer
15 years 5 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
132
Voted
SPC
2005
Springer
15 years 7 months ago
2005
Springer
As Global Positioning System (GPS) receivers become a common feature in cell phones, personal digital assistants, and automobiles, there is a growing interest in tracking larger us...
79
Voted
IJCM
2002
15 years 1 months ago
2002
In Layered Manufacturing (LM), a prototype of a virtual polyhedral object is built by slicing the object into polygonal layers, and then building the layers one after another. In ...
109
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
116
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...