Sciweavers

2853 search results - page 492 / 571
» On the Efficiency of Provenance Queries
Sort
View
BMCBI
2011
14 years 3 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
2001
ACM
213views Database» more  SIGMOD 2001»
16 years 15 hour ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...
INFOCOM
2009
IEEE
15 years 6 months ago
Sensor Network Navigation without Locations
—We propose a pervasive usage of the sensor network infrastructure as a cyber-physical system for navigating internal users in locations of potential danger. Our proposed applica...
Mo Li, Yunhao Liu, Jiliang Wang, Zheng Yang
CIKM
1993
Springer
15 years 4 months ago
Collection Oriented Match
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
Anurag Acharya, Milind Tambe
FOIKS
2006
Springer
15 years 3 months ago
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
Ian Horrocks, Andrei Voronkov