1046 search results - page 51 / 210 » Approximation Algorithms for Domination Search |
104
click to vote
ANOR
2004
15 years 9 days ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
RECOMB
2002
Springer
16 years 23 days ago
2002
Springer
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
113
Voted
DATESO
2007
15 years 1 months ago
2007
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
96
Voted
SOFSEM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. After text retrieval, the next waves in web searching and multimedia retrieval are the search for and delivery of images, music, video, and 3D scenes. Not only the percep...
108
click to vote
SIBGRAPI
2005
IEEE
15 years 6 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...