7129 search results - page 1093 / 1426 » Approximation Algorithms for Treewidth |
145
Voted
SSDBM
2010
IEEE
15 years 1 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...
153
Voted
TASLP
2010
14 years 10 months ago
2010
This paper presents a novel probabilistic approach to speech enhancement. Instead of a deterministic logarithmic relationship, we assume a probabilistic relationship between the fr...
139
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
127
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
267
Voted
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Markov random field (MRF, CRF) models are popular in
computer vision. However, in order to be computationally
tractable they are limited to incorporate only local interactions
a...