569 search results - page 38 / 114 » An efficient clustering method for k-anonymization |
BMVC
2010
14 years 7 months ago
2010
We present a method for live grouping of feature points into persistent 3D clusters as a single camera browses a static scene, with no additional assumptions, training or infrastr...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
HOTOS
2007
IEEE
15 years 1 months ago
2007
IEEE
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
196
click to vote
GECCO
2011
Springer
14 years 1 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we propose an efficient text detection method based on the Laplacian operator. The maximum gradient difference value is computed for each pixel in the Laplacian-fil...