Sciweavers

396 search results - page 19 / 80
» Crossing Numbers
Sort
View
HICSS
1996
IEEE
75views Biometrics» more  HICSS 1996»
13 years 11 months ago
Geographic Variation in Internet Connectivity
This paper presents a measure of Internet "connectivity" (number of connected companies per capita) normalized by the economic "size" of areas in the United St...
Luke M. Froeb, Richard W. Oliver, David A. Weiskop...
CCCG
2010
13 years 8 months ago
k-star-shaped polygons
We introduce k-star-shaped polygons, polygons for which there exists at least one point x such that for any point y of the polygon, segment xy crosses the polygon's boundary ...
Jeff Sember, William Evans
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
ISAAC
1992
Springer
186views Algorithms» more  ISAAC 1992»
13 years 11 months 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
ICDE
2004
IEEE
179views Database» more  ICDE 2004»
14 years 8 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