1188 search results - page 78 / 238 » Extended Graph Unification |
100
click to vote
EVOW
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
98
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
105
Voted
SIGMOD
2010
ACM
15 years 5 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
111
Voted
FASE
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modeling aims at creating small, partial models, e...
100
Voted
ICPR
2008
IEEE
16 years 2 months ago
2008
IEEE
In this paper we propose a novel prior-based variational object segmentation method in a global minimization framework which unifies image segmentation and image denoising. The id...