Sciweavers

6897 search results - page 1328 / 1380
» Parallelization of Modular Algorithms
Sort
View
BMCBI
2011
13 years 1 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
SIGMOD
2012
ACM
288views Database» more  SIGMOD 2012»
12 years 11 days ago
Exploiting MapReduce-based similarity joins
Cloud enabled systems have become a crucial component to efficiently process and analyze massive amounts of data. One of the key data processing and analysis operations is the Sim...
Yasin N. Silva, Jason M. Reed
ICML
1996
IEEE
14 years 10 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore
PODC
2009
ACM
14 years 7 months ago
The wireless synchronization problem
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their roun...
Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, Fabi...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 3 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
« Prev « First page 1328 / 1380 Last » Next »