Sciweavers

463 search results - page 31 / 93
» A General Framework for Graph Sparsification
Sort
View
CVPR
2003
IEEE
14 years 1 months ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
ICRA
2002
IEEE
106views Robotics» more  ICRA 2002»
14 years 19 days ago
An Improved Random Neighborhood Graph Approach
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
Libo Yang, Steven M. LaValle
ICML
2007
IEEE
14 years 8 months ago
Gradient boosting for kernelized output spaces
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
Florence d'Alché-Buc, Louis Wehenkel, Pierr...
ERSHOV
1999
Springer
13 years 12 months ago
Enhanced Control Flow Graphs in Montages
A semi-visual framework for the speci cation of syntax and semantics of imperative programming languages, called Montages, was proposed in an earlier work by the authors. The prima...
Matthias Anlauff, Philipp W. Kutter, Alfonso Piera...
WEBI
2005
Springer
14 years 1 months ago
A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
François Fouss, Alain Pirotte, Marco Saeren...