1629 search results - page 43 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
ICPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Voronoi condensing reduces training patterns of nearest neighbor classifiers without changing the classification boundaries. This method plays important roles not only in the near...
132
click to vote
OOPSLA
2000
Springer
15 years 1 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
EGH
2009
Springer
14 years 7 months ago
2009
Springer
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
TALG
2008
14 years 9 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
DASC
2006
IEEE
15 years 1 months ago
2006
IEEE
Run-time monitoring is a powerful approach for dynamically detecting faults or malicious activity of software systems. However, there are often two obstacles to the implementation...