36 search results - page 7 / 8 » The Query Complexity of Finding Local Minima in the Lattice |
BMCBI
2010
14 years 9 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
155
click to vote
BMCBI
2005
14 years 9 months ago
2005
Background: Alignment of RNA secondary structures is important in studying functional RNA motifs. In recent years, much progress has been made in RNA motif finding and structure a...
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
SAC
2008
ACM
14 years 9 months ago
2008
ACM
Increasing scale, dynamism, and complexity of hybrid grids make traditional grid resource scheduling approaches difficult. In such grids, where resource volatility and dynamism is...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is qui...