89 search results - page 16 / 18 » CP Models for Maximum Common Subgraph Problems |
111
click to vote
IPMI
2005
Springer
16 years 5 months ago
2005
Springer
Here we model the effect of non-overlapping voxels on image registration, and show that a major defect of overlap-only models--their limited capture range--can be alleviated. Theor...
158
click to vote
BMCBI
2010
15 years 5 months ago
2010
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...
151
click to vote
WOMPAT
2001
Springer
15 years 9 months ago
2001
Springer
In contrast to the common belief that OpenMP requires data-parallel extensions to scale well on architectures with non-uniform memory access latency, recent work has shown that it ...
146
Voted
IJCNLP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper, we explore the syntactic relation patterns for opendomain factoid question answering. We propose a pattern extraction method to extract the various relatio...
117
click to vote
CN
2007
15 years 5 months ago
2007
Unsolicited commercial email, commonly known as spam, has become a pressing problem in today’s Internet. In this paper we re-examine the architectural foundations of the current...