3367 search results - page 532 / 674 » Incremental assignment problem |
137
click to vote
BIBE
2005
IEEE
15 years 8 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
113
click to vote
EKAW
2004
Springer
15 years 8 months ago
2004
Springer
Hierarchical categorization is a powerful and convenient method so that it is commonly used in various areas, such as ontologies. Although each hierarchy is useful, there are probl...
119
click to vote
SIROCCO
2010
15 years 4 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
127
click to vote
ACL
2003
15 years 4 months ago
2003
Recent text and speech processing applications such as speech mining raise new and more general problems related to the construction of language models. We present and describe in...
151
click to vote
RIVF
2003
15 years 4 months ago
2003
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...