234 search results - page 10 / 47 » Isolation, Matching, and Counting |
112
click to vote
CSL
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
ISCA
2008
IEEE
15 years 6 months ago
2008
IEEE
Modern processors rely on memory dependence prediction to execute load instructions as early as possible, speculating that they are not dependent on an earlier, unissued store. To...
136
click to vote
ICALP
2009
Springer
16 years 11 hour ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
ICIP
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper introduces a new approach to automatic car detection in monocular large scale aerial images. The extraction is based on a hierarchical 3D-model that describes the promi...
105
click to vote
IWMM
2000
Springer
15 years 3 months ago
2000
Springer
We investigate reference counting in the context of a multithreaded architecture by exploiting two observations: (1) reference-counting can be performed by a transformed program s...