689 search results - page 106 / 138 » Focusing in Linear Meta-logic |
AAAI
1996
13 years 9 months ago
1996
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...
ESA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
DAC
2010
ACM
13 years 8 months ago
2010
ACM
We study diagnosis of segments on speedpaths that fail the timing constraint at the post-silicon stage due to manufacturing variations. We propose a formal procedure that is appli...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
Image spam is an email spam that embeds text content into graphical images to bypass traditional spam filters. The majority of previous approaches focus on filtering image spam ...
ALGORITHMICA
2007
13 years 8 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...