90 search results - page 14 / 18 » Stipple Placement using Distance in a Weighted Graph |
120
click to vote
MCS
2010
Springer
15 years 3 months ago
2010
Springer
Selecting a set of good and diverse base classifiers is essential for building multiple classifier systems. However, almost all commonly used procedures for selecting such base cla...
130
click to vote
PR
2007
15 years 1 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
122
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
101
Voted
ACCV
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. This paper describes a method for topology-free shape morphing based on region cluster-based Earth Mover's Distance (EMD) flows, since existing methods for closed cu...
140
Voted
DAC
2003
ACM
16 years 2 months ago
2003
ACM
Widespread adoption of reconfigurable devices requires system level synthesis techniques to take an application written in a high level language and map it to the reconfigurable d...