Sciweavers

4850 search results - page 6 / 970
» Approximate Data Structures with Applications
Sort
View
PPOPP
2011
ACM
12 years 11 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
14 years 8 months ago
Fuzzy Matching of Web Queries to Structured Data
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
Tao Cheng, Hady Wirawan Lauw, Stelios Paparizos
ICIP
2004
IEEE
14 years 10 months ago
Redundant image representations in security applications
To be efficient, data protection algorithms should generally exploit the properties of the media information in the transform domain. In this paper, we will advocate the use of no...
Philippe Jost, Pierre Vandergheynst, Pascal Frossa...
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
13 years 9 months ago
A Unified Approach to Approximate Proximity Searching
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
IJCNN
2000
IEEE
14 years 25 days ago
A SOM Based Cluster Visualization and Its Application for False Coloring
The self-organizing map SOM is widely used as a data visualization method in various engineering applications. It performs a non-linear mapping from a high-dimensional data spac...
Johan Himberg