Sciweavers

1945 search results - page 323 / 389
» Speeding up Serpent
Sort
View
ALENEX
2010
156views Algorithms» more  ALENEX 2010»
15 years 20 days ago
Tabulation Based 5-Universal Hashing and Linear Probing
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
Mikkel Thorup, Yin Zhang
129
Voted
LBM
2007
15 years 19 days ago
Syntactic Features for Protein-Protein Interaction Extraction
Background: Extracting Protein-Protein Interactions (PPI) from research papers is a way of translating information from English to the language used by the databases that store th...
Rune Sætre, Kenji Sagae, Jun-ichi Tsujii
ICMCS
2010
IEEE
215views Multimedia» more  ICMCS 2010»
14 years 11 months ago
Efficient search of Top-K video subvolumes for multi-instance action detection
Action detection was formulated as a subvolume mutual information maximization problem in [8], where each subvolume identifies where and when the action occurs in the video. Desp...
Norberto A. Goussies, Zicheng Liu, Junsong Yuan
BMCBI
2007
233views more  BMCBI 2007»
14 years 11 months 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
94
Voted
COMCOM
2008
127views more  COMCOM 2008»
14 years 11 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...