Sciweavers

2883 search results - page 379 / 577
» Algorithms for merged indexes
Sort
View
CVPR
1998
IEEE
14 years 11 months ago
An Optimized Interaction Strategy for Bayesian Relevance Feedback
A new algorithm and systematic evaluation is presented for searching a database via relevance feedback. It represents a new image display strategy for the PicHunter system [2, 1]....
Ingemar J. Cox, Matthew L. Miller, Thomas P. Minka...
ICML
2007
IEEE
14 years 10 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen
ISBI
2002
IEEE
14 years 10 months ago
Covariance-driven retinal image registration initialized from small sets of landmark correspondences
An automatic retinal image registration algorithm would be an important tool for detecting visible changes in the retina caused by the progress of a disease or by the impact of a ...
Chia-Ling Tsai, Charles V. Stewart, Badrinath Roys...
WSDM
2010
ACM
210views Data Mining» more  WSDM 2010»
14 years 6 months ago
Leveraging Temporal Dynamics of Document Content in Relevance Ranking
Many web documents are dynamic, with content changing in varying amounts at varying frequencies. However, current document search algorithms have a static view of the document con...
Jonathan L. Elsas, Susan T. Dumais
DASFAA
2009
IEEE
93views Database» more  DASFAA 2009»
14 years 4 months ago
Top-K Correlation Sub-graph Search in Graph Databases
Recently, due to its wide applications, (similar) subgraph search has attracted a lot of attentions from database and data mining community, such as [13, 18, 19, 5]. In [8], Ke et ...
Lei Zou, Lei Chen 0002, Yansheng Lu