1964 search results - page 146 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
172
click to vote
SIGMOD
2004
ACM
15 years 11 months ago
2004
ACM
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
155
click to vote
NIPS
2007
15 years 7 months ago
2007
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
135
click to vote
PAMI
1998
15 years 6 months ago
1998
—Image segmentation is fundamental to many image analysis problems. It aims to partition a digital image into a set of nonoverlapping homogeneous regions. The main contribution o...
181
click to vote
MFCS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
166
click to vote
COLT
2005
Springer
15 years 12 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...