Sciweavers

7648 search results - page 982 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
SDM
2009
SIAM
140views Data Mining» more  SDM 2009»
16 years 3 months ago
Straightforward Feature Selection for Scalable Latent Semantic Indexing.
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
Jun Yan, Shuicheng Yan, Ning Liu, Zheng Chen
CASES
2004
ACM
15 years 12 months ago
A post-compiler approach to scratchpad mapping of code
ScratchPad Memories (SPMs) are commonly used in embedded systems because they are more energy-efficient than caches and enable tighter application control on the memory hierarchy...
Federico Angiolini, Francesco Menichelli, Alberto ...
VLDB
2004
ACM
101views Database» more  VLDB 2004»
15 years 12 months ago
Taming XPath Queries by Minimizing Wildcard Steps
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called...
Chee Yong Chan, Wenfei Fan, Yiming Zeng
CAD
2000
Springer
15 years 6 months ago
Time-critical multiresolution rendering of large complex models
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
Enrico Gobbetti, Eric Bouvier
160
Voted
PKDD
2009
Springer
134views Data Mining» more  PKDD 2009»
16 years 1 months ago
Mining Graph Evolution Rules
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...
Michele Berlingerio, Francesco Bonchi, Björn ...