Sciweavers

439 search results - page 23 / 88
» Engineering Comparators for Graph Clusterings
Sort
View
SIGIR
2010
ACM
13 years 8 months ago
Exploiting click-through data for entity retrieval
We present an approach for answering Entity Retrieval queries using click-through information in query log data from a commercial Web search engine. We compare results using click...
Bodo Billerbeck, Gianluca Demartini, Claudiu S. Fi...
MM
2004
ACM
195views Multimedia» more  MM 2004»
14 years 1 months ago
Hierarchical clustering of WWW image search results using visual, textual and link information
We consider the problem of clustering Web image search results. Generally, the image search results returned by an image search engine contain multiple topics. Organizing the resu...
Deng Cai, Xiaofei He, Zhiwei Li, Wei-Ying Ma, Ji-R...
SIGMOD
2008
ACM
116views Database» more  SIGMOD 2008»
14 years 8 months ago
SPADE: the system s declarative stream processing engine
In this paper, we present Spade - the System S declarative stream processing engine. System S is a large-scale, distributed data stream processing middleware under development at ...
Bugra Gedik, Henrique Andrade, Kun-Lung Wu, Philip...
IPPS
2008
IEEE
14 years 2 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
PAMI
2007
196views more  PAMI 2007»
13 years 7 months ago
Clustering and Embedding Using Commute Times
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
Huaijun Qiu, Edwin R. Hancock