42 search results - page 3 / 9 » An Evaluation of Best Compromise Search in Graphs |
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
EVOW
2007
Springer
15 years 6 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
113
Voted
KDD
2010
ACM
14 years 11 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
106
Voted
FUIN
2007
15 years 18 days ago
2007
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
91
Voted
DAGM
2004
Springer
15 years 6 months ago
2004
Springer
A fundamental problem in image recognition is to evaluate the similarity of two images. This can be done by searching for the best pixel-to-pixel matching taking into account suita...