Sciweavers

987 search results - page 138 / 198
» Asynchronous parallel search by the parallel genetic algorit...
Sort
View
AINA
2009
IEEE
14 years 3 months ago
Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Networks
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...
Andrei Gagarin, Sajid Hussain, Laurence Tianruo Ya...
WWW
2005
ACM
14 years 9 months ago
LSH forest: self-tuning indexes for similarity search
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Mayank Bawa, Tyson Condie, Prasanna Ganesan
SIGIR
2008
ACM
13 years 9 months ago
A method for transferring retrieval scores between collections with non-overlapping vocabularies
We present a method for projecting retrieval scores across two corpora with a shared, parallel corpus. Categories and Subject Descriptors: H.3.3 Information Search and Retrieval: ...
Fernando D. Diaz
PODC
2010
ACM
14 years 29 days ago
Finding mobile data under delay constraints with searching costs
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002,...
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 3 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