Sciweavers

447 search results - page 2 / 90
» Re-ranking search results using document-passage graphs
Sort
View
KDD
2007
ACM
155views Data Mining» more  KDD 2007»
14 years 5 months ago
Mining templates from search result records of search engines
Metasearch engine, Comparison-shopping and Deep Web crawling applications need to extract search result records enwrapped in result pages returned from search engines in response ...
Hongkun Zhao, Weiyi Meng, Clement T. Yu
DAM
2011
13 years 12 days ago
A General Label Search to investigate classical graph search algorithms
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
Richard Krueger, Geneviève Simonet, Anne Be...
JSAT
2008
122views more  JSAT 2008»
13 years 5 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
CIKM
2010
Springer
13 years 2 months ago
A late fusion approach to cross-lingual document re-ranking
The field of information retrieval still strives to develop models which allow semantic information to be integrated in the ranking process to improve performance in comparison to...
Dong Zhou, Séamus Lawless, Jinming Min, Vin...
ACL
2010
13 years 3 months ago
Wikipedia as Sense Inventory to Improve Diversity in Web Search Results
Is it possible to use sense inventories to improve Web search results diversity for one word queries? To answer this question, we focus on two broad-coverage lexical resources of ...
Celina Santamaría, Julio Gonzalo, Javier Ar...