Sciweavers

521 search results - page 28 / 105
» Coring method for clustering a graph
Sort
View
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 4 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
CLUSTER
2003
IEEE
15 years 9 months ago
Compiler Optimized Remote Method Invocation
We further increase the efficiency of Java RMI programs. Where other optimizing re-implementations of RMI use pre-processors to create stubs and skeletons and to create class spe...
Ronald Veldema, Michael Philippsen
ICML
2006
IEEE
16 years 4 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
PDP
2003
IEEE
15 years 9 months ago
Load Balancing for Spatial-grid-based Parallel Numeric Simulations on Clusters of SMPs
Load distribution is an essential factor to parallel efficiency of numerical simulations that are based on spatial grids, especially on clusters of symmetric multiprocessors (SMPs...
Huaien Gao, Andreas Schmidt, Amitava Gupta, Peter ...
WWW
2007
ACM
16 years 4 months ago
On building graphs of documents with artificial ants
We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way re...
Hanane Azzag, Julien Lavergne, Christiane Guinot, ...