Sciweavers

4198 search results - page 282 / 840
» In search of lost time
Sort
View
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
16 years 1 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
WEBDB
2005
Springer
129views Database» more  WEBDB 2005»
16 years 6 days ago
Searching for Hidden-Web Databases
Recently, there has been increased interest in the retrieval and integration of hidden Web data with a view to leverage high-quality information available in online databases. Alt...
Luciano Barbosa, Juliana Freire
CIKM
2005
Springer
16 years 6 days ago
Mining officially unrecognized side effects of drugs by combining web search and machine learning
We consider the problem of finding officially unrecognized side effects of drugs. By submitting queries to the Web involving a given drug name, it is possible to retrieve pages co...
Carlo Curino, Yuanyuan Jia, Bruce Lambert, Patrici...
ECP
1997
Springer
103views Robotics» more  ECP 1997»
15 years 11 months ago
Plan-Refinement Strategies and Search-Space Size
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
Reiko Tsuneto, Dana S. Nau, James A. Hendler
FOCS
2004
IEEE
15 years 10 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev