Sciweavers

7890 search results - page 1327 / 1578
» The MathSAT 3 System
Sort
View
BMCBI
2011
14 years 10 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
ESWS
2011
Springer
14 years 10 months ago
DataFinland - A Semantic Portal for Open and Linked Datasets
The number of open datasets available on the web is increasing rapidly with the rise of the Linked Open Data (LOD) cloud and various governmental efforts for releasing public data ...
Matias Frosterus, Eero Hyvönen, Joonas Laitio
IACR
2011
155views more  IACR 2011»
14 years 6 months ago
Terminating BKZ
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
ICCV
2009
IEEE
16 years 11 months ago
What is the Best Multi-Stage Architecture for Object Recognition?
In many recent object recognition systems, feature extraction stages are generally composed of a filter bank, a non-linear transformation, and some sort of feature pooling layer...
Kevin Jarrett, Koray Kavukcuoglu, Marc’Aurelio R...
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
16 years 8 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
« Prev « First page 1327 / 1578 Last » Next »