Sciweavers

2713 search results - page 3 / 543
» Parameterized Tree Systems
Sort
View
WG
2009
Springer
14 years 4 months ago
Exact and Parameterized Algorithms for Max Internal Spanning Tree
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
Henning Fernau, Serge Gaspers, Daniel Raible
ICDM
2006
IEEE
164views Data Mining» more  ICDM 2006»
14 years 3 months ago
Unsupervised Learning of Tree Alignment Models for Information Extraction
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
Philip Zigoris, Damian Eads, Yi Zhang
CGF
2008
143views more  CGF 2008»
13 years 10 months ago
Sketch-Based Procedural Surface Modeling and Compositing Using Surface Trees
We present a system for creating and manipulating layered procedural surface editing operations, which is motivated by the limited support for iterative design in free-form modeli...
Ryan Schmidt, Karan Singh
CORR
2008
Springer
57views Education» more  CORR 2008»
13 years 10 months ago
Parameterized Low-distortion Embeddings - Graph metrics into lines and trees
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...