Sciweavers

1605 search results - page 212 / 321
» Metric Learning to Rank
Sort
View
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
16 years 4 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
15 years 10 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
16 years 9 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer
MFCS
2007
Springer
15 years 10 months ago
Evolvability
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...
Leslie G. Valiant
COMPSAC
2002
IEEE
15 years 9 months ago
Investigating Large Software System Evolution: The Linux Kernel
Large multi-platform, multi-million lines of codes software systems evolve to cope with new platform or to meet user ever changing needs. While there has been several studies focu...
Ettore Merlo, Michel Dagenais, P. Bachand, J. S. S...