11214 search results - page 257 / 2243 » Just-in-time data structures |
116
click to vote
ICOODB
2010
14 years 11 months ago
2010
Abstract. New emerging applications including genomic, multimedia, and geospatial technologies have necessitated the handling of complex application objects that are highly structu...
SISAP
2008
IEEE
15 years 7 months ago
2008
IEEE
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
135
Voted
KDD
2012
ACM
13 years 3 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
111
click to vote
CORR
2008
Springer
15 years 27 days ago
2008
Springer
: In a data warehousing process, the phase of data integration is crucial. Many methods for data integration have been published in the literature. However, with the development of...
77
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper, we propose tree structure lossless coding, by which compression data are arranged in a tree structure. Current compression methods show improved performance by prod...