14548 search results - page 2831 / 2910 » The Optimal Path-Matching Problem |
DCC
2006
IEEE
14 years 9 months ago
2006
IEEE
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
SDM
2009
SIAM
14 years 7 months ago
2009
SIAM
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...
SDM
2009
SIAM
14 years 7 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
ALT
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
ICCAD
2006
IEEE
14 years 7 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...