681 search results - page 76 / 137 » General Polynomial Time Decomposition Algorithms |
101
click to vote
STOC
1994
ACM
15 years 4 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
90
Voted
STOC
2010
ACM
15 years 4 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
107
click to vote
STOC
2007
ACM
16 years 22 days ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
84
Voted
SIAMSC
2008
15 years 11 days ago
2008
In this paper we present a new incomplete factorization of a square matrix into triangular factors in which we get standard LU or LDLT factors (direct factors) and their inverses (...
90
Voted
ICGI
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...