Sciweavers

CAD
2006
Springer
13 years 11 months ago
Computing minimum distance between two implicit algebraic surfaces
The minimum distance computation problem between two surfaces is very important in many applications such as robotics, CAD/CAM and computer graphics. Given two implicit algebraic ...
Xiao-Diao Chen, Jun-Hai Yong, Guo-Qin Zheng, Jean-...
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 11 months ago
On the order bound for one-point AG codes
The order bound for the minimum distance of algebraic geometry codes is defined for the dual of one-point codes. A new bound for the minimum distance of linear codes, and for codes...
Olav Geil, Carlos Munuera, Diego Ruano, Fernando T...
ARSCOM
2008
192views more  ARSCOM 2008»
13 years 11 months ago
Bounds on the metric and partition dimensions of a graph
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
Glenn G. Chappell, John G. Gimbel, Chris Hartman
ICRA
1998
IEEE
110views Robotics» more  ICRA 1998»
14 years 3 months ago
A Framework for Efficient Minimum Distance Computations
In this paper we present a framework for minimum distance computations that allows efficient solution of minimum distance queries on a variety of surface representations, includin...
David E. Johnson, Elaine Cohen
FOCS
1999
IEEE
14 years 3 months ago
Hardness of Approximating the Minimum Distance of a Linear Code
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
Ilya Dumer, Daniele Micciancio, Madhu Sudan
GMP
2000
IEEE
117views Solid Modeling» more  GMP 2000»
14 years 4 months ago
Distance Computation between Non-Convex Polyhedra at Short Range Based on Discrete Voronoi Regions
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
Katsuaki Kawachi, Hiromasa Suzuki
ISMIR
2004
Springer
113views Music» more  ISMIR 2004»
14 years 4 months ago
Music Recommendation from Song Sets
We motivate the problem of music recommendation based solely on acoustics from groups of related songs or ‘song sets’. We propose four solutions which can be used with any aco...
Beth Logan
SMA
2006
ACM
101views Solid Modeling» more  SMA 2006»
14 years 5 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
ICC
2007
IEEE
14 years 5 months ago
Some Results on the Binary Minimum Distance of Reed-Solomon Codes and Block Turbo Codes
— We study the minimum distance of the binary expansion of high-rate Reed-Solomon (RS) codes and product codes in the polynomial basis and show that the binary codes obtained in ...
Raphaël Le Bidan, Ramesh Pyndiah, Patrick Add...