681 search results - page 2 / 137 » General Polynomial Time Decomposition Algorithms |
DKE
2002
13 years 4 months ago
2002
Topological invariants of spatial databases (i.e., finite structures that capture the topological properties of the database) are receiving increasing attention since they can act...
IJCAI
2001
13 years 5 months ago
2001
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
WG
2005
Springer
13 years 9 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
CAI
1999
Springer
13 years 4 months ago
1999
Springer
TCS
2011
12 years 11 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...