7129 search results - page 781 / 1426 » Approximation Algorithms for Treewidth |
164
click to vote
ICMLA
2008
15 years 8 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
209
click to vote
NIPS
2008
15 years 8 months ago
2008
Actor-critic algorithms for reinforcement learning are achieving renewed popularity due to their good convergence properties in situations where other approaches often fail (e.g.,...
178
click to vote
AAAI
2004
15 years 8 months ago
2004
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
169
click to vote
ACL
2006
15 years 8 months ago
2006
This paper proposes an efficient method of sentence retrieval based on syntactic structure. Collins proposed Tree Kernel to calculate structural similarity. However, structual ret...
192
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...