Sciweavers

1722 search results - page 7 / 345
» On the sample mean of graphs
Sort
View
FUIN
2007
123views more  FUIN 2007»
13 years 9 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
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...
Zbigniew Suraj, Barbara Fryc
DAGM
2007
Springer
14 years 1 months ago
Intrinsic Mean for Semi-metrical Shape Retrieval Via Graph Cuts
We address the problem of describing the mean object for a set of planar shapes in the case that the considered dissimilarity measures are semi-metrics, i.e. in the case that the t...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
ACCV
2006
Springer
14 years 3 months ago
Stereo Matching Using Iterated Graph Cuts and Mean Shift Filtering
In this paper, we propose a new stereo matching algorithm using an iterated graph cuts and mean shift filtering technique. Our algorithm consists of following two steps. In the ...
Ju Yong Chang, Kyoung Mu Lee, Sang Uk Lee
INFOCOM
2003
IEEE
14 years 3 months ago
Sampling Biases in IP Topology Measurements
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
Anukool Lakhina, John W. Byers, Mark Crovella, Pen...
IDA
2009
Springer
14 years 4 months ago
Selecting Computer Architectures by Means of Control-Flow-Graph Mining
Abstract Deciding which computer architecture provides the best performance for a certain program is an important problem in hardware design and benchmarking. While previous approa...
Frank Eichinger, Klemens Böhm