4850 search results - page 66 / 970 » Approximate Data Structures with Applications |
ICDM
2003
IEEE
15 years 3 months ago
2003
IEEE
PixelMaps are a new pixel-oriented visual data mining technique for large spatial datasets. They combine kerneldensity-based clustering with pixel-oriented displays to emphasize c...
132
click to vote
WADS
2007
Springer
15 years 4 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
CAISE
2003
Springer
15 years 3 months ago
2003
Springer
Data Warehouse logical design involves the definition of structures that enable an efficient access to information. The designer builds relational or multidimensional structures ta...
104
click to vote
TSP
2010
14 years 4 months ago
2010
Abstract--An efficient and flexible dictionary structure is proposed for sparse and redundant signal representation. The proposed sparse dictionary is based on a sparsity model of ...
WAIM
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The heterogeneity nature of XML data creates the need for approximate query answering. In this paper, we present an XML system that cooperates with users to provide user-...