3146 search results - page 160 / 630 » Efficient Consequence Finding |
151
click to vote
BIBM
2009
IEEE
15 years 9 months ago
2009
IEEE
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may conta...
130
click to vote
PVLDB
2010
15 years 3 months ago
2010
Despite the huge amount of recent research efforts on entity resolution (matching) there has not yet been a comparative evaluation on the relative effectiveness and efficiency of ...
130
click to vote
EUC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, t...
148
click to vote
CISSE
2008
Springer
15 years 6 months ago
2008
Springer
Localization is the subject matter that has allured the attention of many researchers in the field of wireless sensor network. It is the process of assigning or computing the locat...
144
click to vote
AIPS
1994
15 years 6 months ago
1994
Aimsof traditional planners had beenlimited to finding a sequenceof operators rather than finding an optimal or neax-optimalfinal state. Consequent]y, the performanceimprovementsy...