2600 search results - page 218 / 520 » Clustering with or without the Approximation |
153
click to vote
AUSAI
2007
Springer
16 years 23 days ago
2007
Springer
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
176
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Local tag structures have become frequent through Web 2.0: Users "tag" their data without specifying the underlying semantics. Every user annotates items in an individual...
181
click to vote
CLUSTER
2006
IEEE
15 years 6 months ago
2006
IEEE
Many parallel applications from scientific computing use MPI collective communication operations to collect or distribute data. Since the execution times of these communication op...
156
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
179
click to vote
DAM
2007
15 years 6 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...