1380 search results - page 159 / 276 » A General Polynomial Sieve |
JMLR
2010
13 years 3 months ago
2010
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
MLDM
2010
Springer
13 years 3 months ago
2010
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
TSP
2010
13 years 3 months ago
2010
Abstract--This correspondence considers the problem of robust waveform design in the presence of colored Gaussian disturbance under a similarity and an energy constraint. We resort...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
INFOCOM
2011
IEEE
13 years 10 days ago
2011
IEEE
—To better support interactive applications, individual network operators are decreasing the timers that affect BGP convergence, leading to greater diversity in the timer setting...