510 search results - page 39 / 102 » Searching Solitaire in Real Time |
130
Voted
BIOCOMP
2007
15 years 3 months ago
2007
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
202
click to vote
CP
2009
Springer
16 years 2 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
110
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
108
Voted
DOCENG
2004
ACM
15 years 7 months ago
2004
ACM
In this paper, we discuss how to present the result of searching elements of any type from XML documents relevant to some information need (relevance-oriented search). As the resu...
121
click to vote
ICDE
2007
IEEE
15 years 5 months ago
2007
IEEE
The problem of trajectory similarity in moving object databases is a relatively new topic in the spatial and spatiotemporal database literature. Existing work focuses on the spati...