628 search results - page 59 / 126 » Distance Field Compression |
106
Voted
AAECC
2002
Springer
15 years 19 days ago
2002
Springer
Abstract. For any integral convex polytope in R2 there is an explicit construction of an error-correcting code of length (q - 1)2 over the finite field Fq, obtained by evaluation o...
ICCSA
2005
Springer
15 years 6 months ago
2005
Springer
Vector quantization (VQ) is an elementary technique for image compression. However, searching for the nearest codeword in a codebook is time-consuming. The existing schemes focus o...
142
click to vote
SPIRE
2005
Springer
15 years 6 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
95
Voted
CIKM
2003
Springer
15 years 6 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
138
click to vote
MUE
2008
IEEE
15 years 7 months ago
2008
IEEE
Ad hoc networks are highly dynamic routing networks cooperated by a collection of wireless mobile hosts without any assistance of centralized access point. Secure Efficient Ad hoc...