162 search results - page 32 / 33 » A Simple and Efficient Implementation of Concurrent Local Ta... |
TKDE
2010
13 years 7 months ago
2010
—We investigate techniques to automatically decompose any XQuery query—including updating queries specified by the XQuery Update Facility (XQUF)—into subqueries, that can be ...
BMCBI
2011
13 years 20 days ago
2011
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...
MHCI
2007
Springer
14 years 3 months ago
2007
Springer
This paper presents a photo browsing system on mobile devices to browse and search photos efficiently by tilting action. It employs tilt dynamics and multi-scale photo screen layo...
ALMOB
2006
13 years 9 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
ICFP
2005
ACM
14 years 9 months ago
2005
ACM
Existing languages provide good support for typeful programming of standalone programs. In a distributed system, however, there may be interaction between multiple instances of ma...