432 search results - page 4 / 87 » Minimum Weight Pseudo-Triangulations |
106
Voted
WADS
1993
Springer
15 years 2 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
64
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We propose a novel method for the classification of EEG signals during motor-imagery. For motor-imagery based brain computer interface (MI-BCI), a method called common spatial pa...
TIT
2010
14 years 5 months ago
2010
We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes...
87
Voted
JCO
2010
14 years 8 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
113
Voted
IEICET
2011
14 years 5 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...