1964 search results - page 249 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
116
click to vote
PKDD
2000
Springer
15 years 6 months ago
2000
Springer
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...
121
Voted
FMOODS
2006
15 years 3 months ago
2006
Software Adaptation is a crucial issue for the development of a real market of components promoting software reuse. Recent work in this field has addressed several problems related...
133
click to vote
FSTTCS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
147
Voted
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Stereo matching is an active area of research in image processing. In a recent work, a convex programming approach was developed in order to generate a dense disparity field. In ...
150
Voted
TKDE
2012
13 years 4 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...