248 search results - page 17 / 50 » Clustering Search Approach for the Traveling Tournament Prob... |
TKDE
2008
13 years 8 months ago
2008
Clustering is inherently a difficult task and is made even more difficult when the selection of relevant features is also an issue. In this paper, we propose an approach for simult...
CIBCB
2008
IEEE
14 years 2 months ago
2008
IEEE
sequence content at an abstract level and offers novel ways to examine the information contained in them. Our approach is an information theoretic search process which uses patter...
IIS
2003
13 years 9 months ago
2003
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
BIBE
2008
IEEE
14 years 2 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
ICAI
2004
13 years 9 months ago
2004
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...