Sciweavers

290 search results - page 17 / 58
» Local Partitioning for Directed Graphs Using PageRank
Sort
View
95
Voted
PPSN
1998
Springer
15 years 3 months ago
On Risky Methods for Local Selection under Noise
The choice of the selection method used in an evolutionary algorithm may have considerable impacts on the behavior of the entire algorithm. Therefore, earlier work was devoted to t...
Günter Rudolph
GD
2004
Springer
15 years 5 months ago
Drawing Power Law Graphs
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reid Andersen, Fan R. K. Chung, Lincoln Lu
NIPS
2003
15 years 1 months ago
Feature Selection in Clustering Problems
A novel approach to combining clustering and feature selection is presented. It implements a wrapper strategy for feature selection, in the sense that the features are directly se...
Volker Roth, Tilman Lange
CAIP
2005
Springer
114views Image Analysis» more  CAIP 2005»
15 years 5 months ago
A Segmentation Algorithm for Noisy Images
This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a...
Soufiane Rital, Hocine Cherifi, Serge Miguet
SIROCCO
2007
15 years 1 months ago
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis...