4860 search results - page 308 / 972 » SNPs Problems, Complexity, and Algorithms |
109
Voted
ECCV
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
TIME
2008
IEEE
15 years 7 months ago
2008
IEEE
We survey temporal description logics that are based on standard temporal logics such as LTL and CTL. In particular, we concentrate on the computational complexity of the satisfi...
93
Voted
LSSC
2005
Springer
15 years 6 months ago
2005
Springer
In this contribution we extend our previous results on the structured total least squares problem to the case of weighted cost functions. It is shown that the computational complex...
160
Voted
STAIRS
2008
15 years 2 months ago
2008
This paper presents an extensive evaluation, on artificial datasets, of EDY, an unsupervised algorithm for automatically synthesizing a Structured Hidden Markov Model (S-HMM) from ...
84
Voted
CONEXT
2008
ACM
15 years 2 months ago
2008
ACM
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...