Sciweavers

259 search results - page 10 / 52
» Graph Distances in the Data-Stream Model
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Constrained clustering by a novel graph-based distance transformation
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
Kai Rothaus, Xiaoyi Jiang
SIGCOMM
2009
ACM
14 years 2 months ago
Temporal distance metrics for social network analysis
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...
WAW
2004
Springer
96views Algorithms» more  WAW 2004»
14 years 1 months ago
A Geometric Preferential Attachment Model of Networks
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
Abraham Flaxman, Alan M. Frieze, Juan Vera
MICAI
2005
Springer
14 years 1 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
DAGSTUHL
2007
13 years 9 months ago
Nonlinear Approximation and Image Representation using Wavelets
We address the problem of finding sparse wavelet representations of high-dimensional vectors. We present a lower-bounding technique and use it to develop an algorithm for computi...
Sudipto Guha, Boulos Harb