ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
Conventional similarity metrics used to sustain diversity in evolving populations are not well suited to sequential decision tasks. Genotypes and phenotypic structure are poor pre...
IUI
2009
ACM
14 years 1 months ago
2009
ACM
We designed an interactive visual workspace, MediaGLOW, that supports users in organizing personal and shared photo collections. The system interactively places photos with a spri...
SIGMOD
2006
ACM
14 years 5 months ago
2006
ACM
RECOMB
2003
Springer
14 years 5 months ago
2003
Springer
It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full C representation c...
KDD
2005
ACM
14 years 5 months ago
2005
ACM
Online information services have grown too large for users to navigate without the help of automated tools such as collaborative filtering, which makes recommendations to users ba...
WWW
2004
ACM
14 years 5 months ago
2004
ACM
In many Web search applications, similarities between objects of one type (say, queries) can be affected by the similarities between their interrelated objects of another type (sa...
ICML
2009
IEEE
14 years 5 months ago
2009
IEEE
Information theoretic based measures form a fundamental class of similarity measures for comparing clusterings, beside the class of pair-counting based and set-matching based meas...
ICDE
2002
IEEE
14 years 6 months ago
2002
IEEE
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
CVPR
2006
IEEE
14 years 7 months ago
2006
IEEE
Multi-target tracking requires locating the targets and labeling their identities. The latter is a challenge when many targets, with indistinct appearances, frequently occlude one...