Sciweavers

336 search results - page 17 / 68
» Analytic Cut Trees
Sort
View
COR
2007
87views more  COR 2007»
13 years 7 months ago
An exact algorithm for generating homogenous T-shape cutting patterns
Both the material usage and the complexity of the cutting process should be considered in generating cutting patterns. This paper presents an exact algorithm for constrained two-d...
Yaodong Cui
ISBI
2011
IEEE
12 years 11 months ago
Segmentation of anatomical branching structures based on texture features and graph cut
Segmentation of tree-like structure within medical imaging modalities, such as x-ray, MRI, ultrasound, etc., is an important step for analyzing branching patterns involved in many...
Tatyana Nuzhnaya, Erkang Cheng, Haibin Ling, Despi...
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
14 years 2 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
TABLEAUX
2007
Springer
14 years 1 months ago
A Cut-Free Sequent Calculus for Bi-intuitionistic Logic
Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with...
Linda Buisman, Rajeev Goré
DAM
2007
78views more  DAM 2007»
13 years 7 months ago
Flow trees for vertex-capacitated networks
Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
Refael Hassin, Asaf Levin