Sciweavers

14403 search results - page 139 / 2881
» Dynamical Systems Trees
Sort
View
ICALP
2007
Springer
15 years 10 months ago
An Optimal Decomposition Algorithm for Tree Edit Distance
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 9 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
INFOCOM
1999
IEEE
15 years 8 months ago
Optimal Partition of QoS Requirements on Unicast Paths and Multicast Trees
We investigate the problem of optimal resource allocation for end-to-end QoS requirements on unicast paths and multicast trees. Specifically, we consider a framework in which reso...
Dean H. Lorenz, Ariel Orda
IPCV
2008
15 years 5 months ago
Weighted Embedded Zero Tree for Scalable Video Compression
Video streaming over the Internet has gained popularity during recent years mainly due to the revival of videoconferencing and videotelephony applications and the proliferation of ...
Roya Choupani, Stephan Wong, Mehmet R. Tolun
CGF
1998
101views more  CGF 1998»
15 years 4 months ago
Rapid and Accurate Contact Determination between Spline Models using ShellTrees
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...
Shankar Krishnan, M. Gopi, Ming C. Lin, Dinesh Man...