Sciweavers

3206 search results - page 138 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
GECCO
2007
Springer
206views Optimization» more  GECCO 2007»
15 years 7 months ago
Using code metric histograms and genetic algorithms to perform author identification for software forensics
We have developed a technique to characterize software developers' styles using a set of source code metrics. This style fingerprint can be used to identify the likely author...
Robert Charles Lange, Spiros Mancoridis
ACCV
2009
Springer
15 years 9 months ago
Iterated Graph Cuts for Image Segmentation
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
Bo Peng, Lei Zhang, Jian Yang
ICDE
2008
IEEE
159views Database» more  ICDE 2008»
16 years 4 months ago
Fast Graph Pattern Matching
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
Jiefeng Cheng, Jeffrey Xu Yu, Bolin Ding, Philip S...
ISCA
1994
IEEE
129views Hardware» more  ISCA 1994»
15 years 7 months ago
Impact of Sharing-Based Thread Placement on Multithreaded Architectures
Multithreaded architectures context switch between instruction streams to hide memory access latency. Although this improves processor utilization, it can increase cache interfere...
Radhika Thekkath, Susan J. Eggers
GD
2006
Springer
15 years 6 months ago
Improved Circular Layouts
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...
Emden R. Gansner, Yehuda Koren