Sciweavers

499 search results - page 26 / 100
» On the Decay of Crossing Numbers
Sort
View
FSTTCS
2005
Springer
14 years 1 months ago
Comparing Trees Via Crossing Minimization
Abstract. Two trees with the same number of leaves have to be embedded in two layers in the plane such that the leaves are aligned in two adjacent layers. Additional matching edges...
Henning Fernau, Michael Kaufmann, Mathias Poths
ISAAC
1992
Springer
186views Algorithms» more  ISAAC 1992»
14 years 3 days ago
Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs
Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k &quo...
Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
MVA
2000
119views Computer Vision» more  MVA 2000»
13 years 9 months ago
Feature Ordering by Cross Validation for Face Detection
This paper presents the method to determine the order of feature (attention) points for face detection. The order of feature points is determined in terms of the classification ab...
Takio Kurita, Kazuhiro Hotta, Taketoshi Mishima
ICDE
2004
IEEE
179views Database» more  ICDE 2004»
14 years 9 months ago
CrossMine: Efficient Classification Across Multiple Database Relations
Most of today's structured data is stored in relational databases. Such a database consists of multiple relations which are linked together conceptually via entity-relationsh...
Xiaoxin Yin, Jiawei Han, Jiong Yang, Philip S. Yu
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