Sciweavers

3708 search results - page 297 / 742
» Approximating Betweenness Centrality
Sort
View
IJCNN
2006
IEEE
16 years 21 days ago
Information Theoretic Angle-Based Spectral Clustering: A Theoretical Analysis and an Algorithm
— Recent work has revealed a close connection between certain information theoretic divergence measures and properties of Mercer kernel feature spaces. Specifically, it has been...
Robert Jenssen, Deniz Erdogmus, Jose C. Principe
KCAP
2005
ACM
16 years 6 days ago
OLA in the OAEI 2005 Alignment Contest
Among the variety of alignment approaches (e.g., using machine learning, subsumption computation, formal concept analysis, etc.) similarity-based ones rely on a quantitative asses...
Jérôme Euzenat, Philippe Guéga...
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
16 years 19 hour ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
PVM
2004
Springer
16 years 8 hour ago
A Refinement Strategy for a User-Oriented Performance Analysis
We introduce a refinement strategy to bring the parallel performance analysis closer to the user. The analysis starts with a simple high-level performance model. It is based on fir...
Jan Lemeire, Andy Crijns, John Crijns, Erik F. Dir...
FM
2003
Springer
112views Formal Methods» more  FM 2003»
15 years 12 months ago
Structuring Retrenchments in B by Decomposition
Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [1] as a liberalisation of classical refinement, for the formal description of application developments ...
Michael Poppleton, Richard Banach