Sciweavers

1047 search results - page 60 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
CIKM
2008
Springer
13 years 9 months ago
Query suggestion using hitting time
Generating alternative queries, also known as query suggestion, has long been proved useful to help a user explore and express his information need. In many scenarios, such sugges...
Qiaozhu Mei, Dengyong Zhou, Kenneth Ward Church
BMCBI
2010
135views more  BMCBI 2010»
13 years 8 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...
ICASSP
2009
IEEE
13 years 11 months ago
Spoken dialog strategy based on understanding graph search
We regarded information retrieval as a graph search problem and proposed several novel dialog strategies that can recover from misrecognition through a spoken dialog that traverse...
Yuji Kinoshita, Chiyomi Miyajima, Norihide Kitaoka...
PVLDB
2010
116views more  PVLDB 2010»
13 years 2 months ago
Computing Closed Skycubes
In this paper, we tackle the problem of efficient skycube computation. We introduce a novel approach significantly reducing domination tests for a given subspace and the number of...
Chedy Raïssi, Jian Pei, Thomas Kister
TREC
2003
13 years 9 months ago
Experiments in TREC 2003 Genomics Track at NTT
500,000 PubMed abstracts. However, less than 50 documents are relevant for most queries. Applying scoring to all 500,000 abstracts would create a lot of noise. In the first step, ...
Hirotoshi Taira, Tomonori Izumitani, Tsutomu Hirao...