Sciweavers

2712 search results - page 106 / 543
» Sequence Comparison Using a Relational Database Approach
Sort
View
106
Voted
BMCBI
2007
233views more  BMCBI 2007»
15 years 22 days ago
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
Isaac T. S. Li, Warren Shum, Kevin Truong
JMLR
2012
13 years 3 months ago
Hierarchical Relative Entropy Policy Search
Many real-world problems are inherently hierarchically structured. The use of this structure in an agent’s policy may well be the key to improved scalability and higher performa...
Christian Daniel, Gerhard Neumann, Jan Peters
CIDR
2011
253views Algorithms» more  CIDR 2011»
14 years 4 months ago
Answering Queries using Humans, Algorithms and Databases
For some problems, human assistance is needed in addition to automated (algorithmic) computation. In sharp contrast to existing data management approaches, where human input is ei...
Aditya G. Parameswaran, Neoklis Polyzotis
SIGMOD
2007
ACM
137views Database» more  SIGMOD 2007»
16 years 23 days ago
Intensional associations between data and metadata
There is a growing need to associate a variety of metadata with the underlying data, but a simple, elegant approach to uniformly model and query both the data and the metadata has...
Divesh Srivastava, Yannis Velegrakis
SDB
1995
178views Database» more  SDB 1995»
15 years 4 months ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin