Sciweavers

2457 search results - page 174 / 492
» Local Search with Bootstrapping
Sort
View
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 4 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
BMCBI
2011
14 years 7 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
IPPS
2002
IEEE
15 years 9 months ago
Implementing Associative Search and Responder Resolution
In a paper presented last year at WMPP’01 [Walker01], we described the initial prototype of an associative processor implemented using field-programmable logic devices (FPLDs). ...
Meiduo Wu, Robert A. Walker, Jerry L. Potter
WWW
2009
ACM
16 years 4 months ago
Discovering users' specific geo intention in web search
Discovering users' specific and implicit geographic intention in web search can greatly help satisfy users' information needs. We build a geo intent analysis system that...
Xing Yi, Hema Raghavan, Chris Leggetter
ICSM
2007
IEEE
15 years 10 months ago
A Maintainable Software Architecture for Fast and Modular Bioinformatics Sequence Search
Bioinformaticists use the Basic Local Alignment Search Tool (BLAST) to characterize an unknown sequence by comparing it against a database of known sequences, thus detecting evolu...
Jeremy S. Archuleta, Eli Tilevich, Wu-chun Feng