Sciweavers

2489 search results - page 76 / 498
» On the Subgroup Distance Problem
Sort
View
JPDC
2000
47views more  JPDC 2000»
15 years 7 months ago
Time-Step Optimal Broadcasting in 3-D Meshes with Minimum Total Communication Distance
In this paper we propose a new minimum total communication distance T CD algorithm and an optimal T CD algorithm for broadcast in a 3-dimensional mesh 3-D mesh. The former generat...
Songluan Cang, Jie Wu
182
Voted
PIMRC
2010
IEEE
15 years 5 months ago
Euclidean distance decomposition to generate new 16-QAM and 64-QAM space-time trellis codes
In this paper, the generation of 16-QAM and 64-QAM space-time trellis codes (STTCs) for several transmit antennas is considered. The main problem with an exhaustive search is the i...
Pierre Viland, Gheorghe Zaharia, Jean-Franç...
COMPGEOM
2006
ACM
16 years 1 months ago
How to get close to the median shape
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
Sariel Har-Peled
COMPGEOM
2011
ACM
14 years 10 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
PVLDB
2011
14 years 10 months ago
An Incremental Hausdorff Distance Calculation Algorithm
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
Sarana Nutanong, Edwin H. Jacox, Hanan Samet