Sciweavers

230 search results - page 13 / 46
» The distance trisector curve
Sort
View
ICDM
2003
IEEE
71views Data Mining» more  ICDM 2003»
14 years 3 months ago
Tree-structured Partitioning Based on Splitting Histograms of Distances
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution...
Longin Jan Latecki, Rajagopal Venugopal, Marc Sobe...
DCC
2001
IEEE
14 years 9 months ago
Weierstrass Pairs and Minimum Distance of Goppa Codes
We prove that elements of the Weierstrass gap set of a pair of points may be used to define a geometric Goppa code which has minimum distance greater than the usual lower bound. We...
Gretchen L. Matthews
DCC
2010
IEEE
13 years 10 months ago
Minimum distance of Hermitian two-point codes
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
Seungkook Park
DM
2008
93views more  DM 2008»
13 years 10 months ago
Nonbinary quantum error-correcting codes from algebraic curves
We give a new exposition and proof of a generalized CSS construction for nonbinary quantum error-correcting codes. Using this we construct nonbinary quantum stabilizer codes with ...
Jon-Lark Kim, Judy Walker
SMA
2006
ACM
101views Solid Modeling» more  SMA 2006»
14 years 3 months ago
A higher dimensional formulation for robust and interactive distance queries
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
Joon-Kyung Seong, David E. Johnson, Elaine Cohen