1522 search results - page 145 / 305 » On the Complexity of Several Haplotyping Problems |
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
EVOW
2003
Springer
15 years 3 months ago
2003
Springer
Evolutionary Algorithms (EAs) have been proposed as a very powerful heuristic optimization technique to solve complex problems. Many case studies have shown that they work very eff...
ISCAS
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
IDA
1997
Springer
15 years 2 months ago
1997
Springer
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...