Sciweavers

1538 search results - page 53 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
14 years 3 months ago
Modeling the Search Landscape of Metaheuristic Software Clustering Algorithms
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
Brian S. Mitchell, Spiros Mancoridis
SDM
2008
SIAM
176views Data Mining» more  SDM 2008»
13 years 11 months ago
A General Model for Multiple View Unsupervised Learning
Multiple view data, which have multiple representations from different feature spaces or graph spaces, arise in various data mining applications such as information retrieval, bio...
Bo Long, Philip S. Yu, Zhongfei (Mark) Zhang
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 11 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
CVIU
2006
105views more  CVIU 2006»
13 years 10 months ago
The representation and matching of categorical shape
We present a framework for categorical shape recognition. The coarse shape of an object is captured by a multiscale blob decomposition, representing the compact and elongated part...
Ali Shokoufandeh, Lars Bretzner, Diego Macrini, M....
ICDM
2005
IEEE
148views Data Mining» more  ICDM 2005»
14 years 3 months ago
A Graph-Ranking Algorithm for Geo-Referencing Documents
This paper presents an application of PageRank for assigning documents with a corresponding geographical scope. We describe the technique in detail, together with its theoretical ...
Bruno Martins, Mário J. Silva