8600 search results - page 569 / 1720 » Measuring with Timed Patterns |
161
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
155
click to vote
TIP
2008
15 years 6 months ago
2008
We provide a detailed analysis of the use of minimal spanning graphs as an alignment method for registering multimodal images. This yields an efficient graph theoretic algorithm th...
193
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
158
click to vote
CPM
1993
Springer
15 years 10 months ago
1993
Springer
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
191
click to vote
PDPTA
2000
15 years 7 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...