Sciweavers

2229 search results - page 366 / 446
» Comparative analysis of biclustering algorithms
Sort
View
VISUALIZATION
1993
IEEE
14 years 2 months ago
Rapid Exploration of Curvilinear Grids Using Direct Volume Rendering
Fast techniques for direct volume rendering over curvilinear grids of hexahedral cells are developed. This type of 3D grid is common in computational uid dynamics and nite element...
Allen Van Gelder, Jane Wilhelms
DAC
1994
ACM
14 years 2 months ago
Dynamic Search-Space Pruning Techniques in Path Sensitization
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay fault testing. Path...
João P. Marques Silva, Karem A. Sakallah
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
14 years 2 months ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
CASES
2007
ACM
14 years 2 months ago
Cache leakage control mechanism for hard real-time systems
Leakage energy consumption is an increasingly important issue as the technology continues to shrink. Since on-chip caches constitute a major portion of the processor's transi...
Jaw-Wei Chi, Chia-Lin Yang, Yi-Jung Chen, Jian-Jia...
CP
2007
Springer
14 years 2 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti