1591 search results - page 120 / 319 » Random lifts of graphs |
158
click to vote
DAM
2008
15 years 6 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
167
click to vote
CVPR
1998
IEEE
16 years 8 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
192
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
131
click to vote
AAAI
1998
15 years 7 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
102
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...