1379 search results - page 229 / 276 » The Complexity of the Annihilating Polynomial |
COLT
1994
Springer
15 years 2 months ago
1994
Springer
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
113
click to vote
FSTTCS
1993
Springer
15 years 2 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
AIIA
2007
Springer
15 years 2 months ago
2007
Springer
One of the aims of modern Bioinformatics is to discover the molecular mechanisms that rule the protein operation. This would allow us to understand the complex processes involved i...
CIDM
2007
IEEE
15 years 2 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
108
click to vote
GLOBECOM
2007
IEEE
15 years 1 months ago
2007
IEEE
Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing powerefficient ro...