Sciweavers

1882 search results - page 6 / 377
» Transformational Programming and Forests
Sort
View
ICALP
2007
Springer
14 years 2 months ago
A Combinatorial Theorem for Trees
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...
Thomas Colcombet
TAMC
2010
Springer
13 years 6 months ago
Two-Layer Planarization Parameterized by Feedback Edge Set
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
Johannes Uhlmann, Mathias Weller
PPOPP
2009
ACM
14 years 9 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
SIBGRAPI
2007
IEEE
14 years 2 months ago
Seed-Relative Segmentation Robustness of Watershed and Fuzzy Connectedness Approaches
This paper analyzes the robustness issue in three segmentation approaches: the iterative relative fuzzy object extraction, the watershed transforms (WT) by image foresting transfo...
Romaric Audigier, Roberto de Alencar Lotufo
SAC
2004
ACM
14 years 1 months ago
Forest trees for on-line data
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
João Gama, Pedro Medas, Ricardo Rocha