Sciweavers

1500 search results - page 178 / 300
» Comparison of distances between measures
Sort
View
SIGIR
2002
ACM
15 years 6 months ago
Document clustering with committees
Document clustering is useful in many information retrieval tasks: document browsing, organization and viewing of retrieval results, generation of Yahoo-like hierarchies of docume...
Patrick Pantel, Dekang Lin
CIDM
2011
IEEE
14 years 10 months ago
Partial generalized correlation for hyperspectral data
Abstract—A variational approach is proposed for the unsupervised assessment of attribute variability of high-dimensional data given a differentiable similarity measure. The key q...
Marc Strickert, Bjorn Labitzke, Volker Blanz
WSDM
2009
ACM
114views Data Mining» more  WSDM 2009»
16 years 1 months ago
Wikipedia pages as entry points for book search
A lot of the world’s knowledge is stored in books, which, as a result of recent mass-digitisation efforts, are increasingly available online. Search engines, such as Google Book...
Marijn Koolen, Gabriella Kazai, Nick Craswell
ECML
2004
Springer
15 years 12 months ago
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Marco Saerens, François Fouss, Luh Yen, Pie...
ISPD
2003
ACM
79views Hardware» more  ISPD 2003»
15 years 11 months ago
Floorplanning of pipelined array modules using sequence pairs
Floorplanning individual pipelined array modules of a larger overall die can yield beneficial results. Critical paths in every pipeline stage of a pipelined design are roughly equ...
Matthew Moe, Herman Schmit