Sciweavers

304 search results - page 49 / 61
» Mining query subtopics from search log data
Sort
View
SIGIR
2010
ACM
15 years 1 months ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 1 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
SISAP
2010
IEEE
135views Data Mining» more  SISAP 2010»
14 years 7 months ago
Improving the similarity search of tandem mass spectra using metric access methods
In biological applications, the tandem mass spectrometry is a widely used method for determining protein and peptide sequences from an ”in vitro” sample. The sequences are not...
Jiri Novák, Tomás Skopal, David Hoks...
BMCBI
2006
131views more  BMCBI 2006»
14 years 9 months ago
Statistical modeling of biomedical corpora: mining the Caenorhabditis Genetic Center Bibliography for genes related to life span
Background: The statistical modeling of biomedical corpora could yield integrated, coarse-to-fine views of biological phenomena that complement discoveries made from analysis of m...
David M. Blei, K. Franks, Michael I. Jordan, I. Sa...
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
15 years 1 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang