5100 search results - page 336 / 1020 » The Linear Complexity of a Graph |
135
click to vote
BMCBI
2005
15 years 4 months ago
2005
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
134
click to vote
AAAI
2004
15 years 6 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
174
click to vote
SIGMOD
2010
ACM
15 years 3 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
179
Voted
BMCBI
2011
14 years 12 months ago
2011
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...
150
click to vote
CTRSA
2009
Springer
15 years 11 months ago
2009
Springer
CTC is a toy cipher designed in order to assess the strength of algebraic attacks. While the structure of CTC is deliberately weak with respect to algebraic attacks, it was claimed...