4131 search results - page 481 / 827 » The Generalized Max-Controlled Set Problem |
138
click to vote
SWAT
1990
Springer
15 years 11 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
183
Voted
CIBCB
2007
IEEE
15 years 11 months ago
2007
IEEE
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...
196
click to vote
DAGM
2007
Springer
15 years 10 months ago
2007
Springer
We address the problem of describing the mean object for a set of planar shapes in the case that the considered dissimilarity measures are semi-metrics, i.e. in the case that the t...
175
click to vote
SIGIR
2010
ACM
15 years 10 months ago
2010
ACM
We focus on the task of target detection in automatic link generation with Wikipedia, i.e., given an N-gram in a snippet of text, find the relevant Wikipedia concepts that explai...
173
click to vote
GCB
2007
Springer
15 years 10 months ago
2007
Springer
: Markov models have been proposed for the classification of DNA-motifs using generative approaches for parameter learning. Here, we propose to apply the discriminative paradigm fo...