Sciweavers

654 search results - page 110 / 131
» Matrix Graph Grammars
Sort
View
PKDD
2005
Springer
145views Data Mining» more  PKDD 2005»
14 years 2 months ago
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
Jinyan Li, Haiquan Li, Donny Soh, Limsoon Wong
WEBI
2005
Springer
14 years 2 months ago
HITS is Principal Components Analysis
In this work, we show that Kleinberg’s hubs and authorities model (HITS) is simply Principal Components Analysis (PCA; maybe the most widely used multivariate statistical analys...
Marco Saerens, François Fouss
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
14 years 10 days ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
ECML
2006
Springer
14 years 8 days ago
Multiple-Instance Learning Via Random Walk
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
Dong Wang, Jianmin Li, Bo Zhang
FSTTCS
2000
Springer
14 years 6 days ago
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
Michael R. Fellows, Catherine McCartin, Frances A....