352 search results - page 36 / 71 » A local search approximation algorithm for k-means clusterin... |
SSDBM
2010
IEEE
14 years 7 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Hidden Markov models (HMMs) have received considerable attention in various communities (e.g, speech recognition, neurology and bioinformatic) since many applications that use HMM...
CIBCB
2007
IEEE
15 years 1 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...
102
click to vote
EMMCVPR
2003
Springer
15 years 2 months ago
2003
Springer
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...