Sciweavers

40 search results - page 7 / 8
» Search result re-ranking based on gap between search queries...
Sort
View
TKDE
2008
195views more  TKDE 2008»
13 years 5 months ago
Learning a Maximum Margin Subspace for Image Retrieval
One of the fundamental problems in Content-Based Image Retrieval (CBIR) has been the gap between low-level visual features and high-level semantic concepts. To narrow down this gap...
Xiaofei He, Deng Cai, Jiawei Han
ASUNAM
2009
IEEE
14 years 9 days ago
Harnessing Wisdom of the Crowds Dynamics for Time-Dependent Reputation and Ranking
—The “wisdom of the crowds” is a concept used to describe the utility of harnessing group behaviour, where user opinion evolves over time and the opinion of the masses collec...
Elizabeth M. Daly
WWW
2007
ACM
14 years 6 months ago
Towards effective browsing of large scale social annotations
This paper is concerned with the problem of browsing social annotations. Today, a lot of services (e.g., Del.icio.us, Filckr) have been provided for helping users to manage and sh...
Rui Li, Shenghua Bao, Yong Yu, Ben Fei, Zhong Su
CIKM
2007
Springer
13 years 11 months ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 8 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu