284 search results - page 26 / 57 » Attributed Graph Matching Using Local Descriptions |
111
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
107
click to vote
DAWAK
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. A federated data warehouse is a logical integration of data warehouses applicable when physical integration is impossible due to privacy policy or legal restrictions. In ...
120
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—In road networks, sensors are deployed sparsely (hundreds of meters apart) to save costs. This makes the existing localization solutions based on the ranging be ineffect...
135
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
97
Voted
ACSD
2005
IEEE
15 years 7 months ago
2005
IEEE
This paper presents our approach to model distributed discrete event simulation systems in the framework of distributed graph transformation. We use distributed typed attributed g...