Sciweavers

1538 search results - page 103 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
TPHOL
2008
IEEE
15 years 7 months ago
Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
Daniel Wasserrab, Andreas Lochbihler
NCA
2002
IEEE
15 years 1 months ago
Comparison of Algorithmic and Machine Learning Approaches for the Automatic Fitting of Gaussian Peaks
Fitting gaussian peaks to experimental data is important in many disciplines, including nuclear spectroscopy. Nonlinear least squares fitting methods have been in use for a long t...
Radwan E. Abdel-Aal
AIRS
2006
Springer
15 years 5 months ago
Natural Document Clustering by Clique Percolation in Random Graphs
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
Wei Gao, Kam-Fai Wong
IM
2007
15 years 1 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito
GECCO
2004
Springer
152views Optimization» more  GECCO 2004»
15 years 6 months ago
Ant System for the k-Cardinality Tree Problem
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
Thang Nguyen Bui, Gnanasekaran Sundarraj