1998 search results - page 332 / 400 » Complexity of the Cover Polynomial |
COMPGEOM
1993
ACM
14 years 3 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
COLT
1994
Springer
14 years 3 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...
FSTTCS
1993
Springer
14 years 3 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
14 years 3 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
14 years 3 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 ...