Sciweavers

100 search results - page 13 / 20
» Closure and factor-critical graphs
Sort
View
IPPS
2002
IEEE
15 years 4 months ago
Optimizing Graph Algorithms for Improved Cache Performance
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
Joon-Sang Park, Michael Penner, Viktor K. Prasanna
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
15 years 9 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
CAV
2009
Springer
165views Hardware» more  CAV 2009»
15 years 3 months ago
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. The transformations should preserve the fu...
Sven Verdoolaege, Gerda Janssens, Maurice Bruynoog...
NIPS
2003
15 years 1 months ago
Salient Boundary Detection using Ratio Contour
This paper presents a novel graph-theoretic approach, named ratio contour, to extract perceptually salient boundaries from a set of noisy boundary fragments detected in real image...
Song Wang, Toshiro Kubota, Jeffrey Mark Siskind
PAAPP
2000
118views more  PAAPP 2000»
14 years 11 months ago
Processor-time-optimal systolic arrays
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
Peter R. Cappello, Ömer Egecioglu, Chris J. S...