Sciweavers

7264 search results - page 515 / 1453
» A multiplicative up-propagation algorithm
Sort
View
245
Voted
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
263
Voted
EDBT
2011
ACM
225views Database» more  EDBT 2011»
14 years 10 months ago
SeMiTri: a framework for semantic annotation of heterogeneous trajectories
GPS devices allow recording the movement track of the moving object they are attached to. This data typically consists of a stream of spatio-temporal (x,y,t) points. For applicati...
Zhixian Yan, Dipanjan Chakraborty, Christine Paren...
224
Voted
IACR
2011
111views more  IACR 2011»
14 years 6 months ago
Secure Multi-Party Sorting and Applications
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
Kristján Valur Jónsson, Gunnar Kreit...
PPOPP
2012
ACM
14 years 2 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
SIGIR
2012
ACM
13 years 9 months ago
Mining query subtopics from search log data
Most queries in web search are ambiguous and multifaceted. Identifying the major senses and facets of queries from search log data, referred to as query subtopic mining in this pa...
Yunhua Hu, Ya-nan Qian, Hang Li, Daxin Jiang, Jian...