2766 search results - page 181 / 554 » Algorithms for trigonometric polynomials |
202
click to vote
NETWORKS
2011
14 years 11 months ago
2011
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival...
124
click to vote
ICML
1996
IEEE
16 years 5 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
173
click to vote
DIS
2007
Springer
15 years 8 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
118
click to vote
DAGSTUHL
2003
15 years 5 months ago
2003
Homotopy continuation methods have proven to be reliable and efficient to approximate all isolated solutions of polynomial systems. In this paper we show how we can use this capabi...
126
click to vote
UAI
2004
15 years 5 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...