Sciweavers

136 search results - page 25 / 28
» Graph Nodes Clustering Based on the Commute-Time Kernel
Sort
View
ICCV
2005
IEEE
15 years 11 months ago
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
Marius Leordeanu, Martial Hebert
MICAI
2005
Springer
15 years 3 months ago
Modelling Human Intelligence: A Learning Mechanism
We propose a novel, high-level model of human learning and cognition, based on association forming. The model configures any input data stream featuring a high incidence of repeti...
Enrique Carlos Segura, Robin W. Whitty
PC
2007
161views Management» more  PC 2007»
14 years 9 months ago
High performance combinatorial algorithm design on the Cell Broadband Engine processor
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
David A. Bader, Virat Agarwal, Kamesh Madduri, Seu...
80
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
Modeling the Evolution of Degree Correlation in Scale-Free Topology Generators
—In this paper, we examine the asymptotic behavior of degree correlation (i.e., the joint degree distribution of adjacent nodes) in several scale-free topology generators GED [13...
Xiaoming Wang, Xiliang Liu, Dmitri Loguinov
SIGMOD
2011
ACM
270views Database» more  SIGMOD 2011»
14 years 12 days ago
Automatic discovery of attributes in relational databases
In this work we design algorithms for clustering relational columns into attributes, i.e., for identifying strong relationships between columns based on the common properties and ...
Meihui Zhang, Marios Hadjieleftheriou, Beng Chin O...