8917 search results - page 437 / 1784 » Abstraction in Algorithm Animation |
165
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
161
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
190
Voted
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We prove asymptotically optimal bounds on the Gaussian noise sensitivity of degree-d polynomial threshold functions. These bounds translate into optimal bounds on the Gau...
196
click to vote
FAW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
149
click to vote
DAGSTUHL
2003
15 years 8 months ago
2003
Abstract. Kummer type formulas are identities of hypergeometric series. A symmetry by the permutations of n-letters yields these formulas. We will present an algorithmic method to ...