Sciweavers

3133 search results - page 308 / 627
» Representing clusters for retrieval
Sort
View
VIP
2003
15 years 8 months ago
Using Dual Cascading Learning Frameworks for Image Indexing
To bridge the semantic gap in content-based image retrieval, detecting meaningful visual entities (e.g. faces, sky, foliage, buildings etc) in image content and classifying images...
Joo-Hwee Lim, Jesse S. Jin
SIGIR
2009
ACM
16 years 1 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
CCGRID
2006
IEEE
16 years 26 days ago
An Extensible Resource Discovery Mechanism for Grid Computing Environments
Grid computing is emerging as a new infrastructure to provide collaborative and secure resource sharing over multiple geographically distributed organizations. In this scenario, r...
Tania Gomes Ramos, Alba Cristina Magalhaes Alves d...
WWW
2010
ACM
15 years 10 months ago
Diversifying landmark image search results by learning interested views from community photos
In this paper, we demonstrate a novel landmark photo search and browsing system, Agate, which ranks landmark image search results considering their relevance, diversity and qualit...
Yuheng Ren, Mo Yu, Xin-Jing Wang, Lei Zhang, Wei-Y...
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
15 years 10 months ago
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
Hans-Peter Kriegel, Bernhard Seeger