1217 search results - page 170 / 244 » On compressing frequent patterns |
163
click to vote
IEEEINTERACT
2003
IEEE
15 years 9 months ago
2003
IEEE
Recent studies on program execution behavior reveal that a large amount of execution time is spent in small frequently executed regions of code. Whereas adaptive cache management ...
144
Voted
FPL
2003
Springer
15 years 9 months ago
2003
Springer
With an aim to understand the information encoded by DNA sequences, databases containing large amount of DNA sequence information are frequently compared and searched for matching ...
158
Voted
IBPRIA
2003
Springer
15 years 9 months ago
2003
Springer
A wide variety of texture feature extraction methods have been proposed for texture based image classification and segmentation. These methods are typically evaluated over windows...
134
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
137
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...