Sciweavers

1192 search results - page 197 / 239
» Symbolic Query Exploration
Sort
View
BMCBI
2011
14 years 5 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
13 years 9 months ago
Learning to rank with multi-aspect relevance for vertical search
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
Changsung Kang, Xuanhui Wang, Yi Chang, Belle L. T...
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 4 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
SIGIR
2012
ACM
13 years 4 months ago
Improving searcher models using mouse cursor activity
Web search components such as ranking and query suggestions analyze the user data provided in query and click logs. While this data is easy to collect and provides information abo...
Jeff Huang, Ryen W. White, Georg Buscher, Kuansan ...
101
Voted
ICPR
2002
IEEE
16 years 2 months ago
A Statistical Modeling Approach to Content Based Video Retrieval
Statistical modeling for content based retrieval is examined in the context of recent TREC Video benchmark exercise. The TREC Video exercise can be viewed as a test bed for evalua...
Milind R. Naphade, Sankar Basu, John R. Smith, Chi...