Sciweavers

390 search results - page 9 / 78
» Simplified similarity scoring using term ranks
Sort
View
SODA
1997
ACM
169views Algorithms» more  SODA 1997»
14 years 11 months ago
Partial Matching of Planar Polylines Under Similarity Transformations
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2  time, Omn space algorithm to nd portions of the text" T which are similar in sh...
Scott D. Cohen, Leonidas J. Guibas
SIGIR
2011
ACM
14 years 14 days ago
Cluster-based fusion of retrieved lists
Methods for fusing document lists that were retrieved in response to a query often use retrieval scores (or ranks) of documents in the lists. We present a novel probabilistic fusi...
Anna Khudyak Kozorovitzky, Oren Kurland
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
15 years 4 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
CIKM
2009
Springer
15 years 4 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
TREC
2007
14 years 10 months ago
CSIR at TREC 2007 Expert Search Task
This is the second year for the participation of Center for Studies of Information Resources (CSIR) in the TREC Expert Search Task. Rather than using the candidate profile based ap...
Jiepu Jiang, Wei Lu, Dan Liu