388 search results - page 51 / 78 » An approximate algorithm for median graph computation using ... |
TKDE
2008
13 years 7 months ago
2008
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper proposes a method to compute the likelihood function for the amplitudes and phase shifts of noisily observed phase-locked and amplitude-constrained sinusoids. The sinus...
NIPS
2004
13 years 9 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...