681 search results - page 2 / 137 » General Polynomial Time Decomposition Algorithms |
134
Voted
DKE
2002
15 years 28 days 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...
127
Voted
IJCAI
2001
15 years 2 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...
103
Voted
WG
2005
Springer
15 years 6 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...
71
Voted
CAI
1999
Springer
15 years 24 days ago
1999
Springer
144
Voted
TCS
2011
14 years 8 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...