1542 search results - page 134 / 309 » The metamathematics of random graphs |
291
click to vote
PODC
2011
ACM
14 years 10 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
267
Voted
CVPR
2012
IEEE
13 years 10 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
191
Voted
CVPR
1998
IEEE
16 years 9 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...
222
click to vote
ECML
2006
Springer
15 years 11 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...
159
Voted
AAAI
1998
15 years 8 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...