Sciweavers

432 search results - page 4 / 87
» Minimum Weight Pseudo-Triangulations
Sort
View
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
13 years 11 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
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...
Andy Mirzaian
ICASSP
2011
IEEE
12 years 11 months ago
Classification by weighting for spatio-frequency components of EEG signal during motor imagery
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...
Hiroshi Higashi, Toshihisa Tanaka
TIT
2010
130views Education» more  TIT 2010»
13 years 2 months ago
Affine Grassmann codes
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...
Peter Beelen, Sudhir R. Ghorpade, Tom Høhol...
JCO
2010
182views more  JCO 2010»
13 years 5 months ago
Polynomial time approximation schemes for minimum disk cover problems
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...
Chen Liao, Shiyan Hu
IEICET
2011
13 years 2 months ago
Minimum Spanning Tree Problem with Label Selection
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...
Akio Fujiyoshi, Masakazu Suzuki