Sciweavers

DCG
2010
135views more  DCG 2010»
13 years 11 months ago
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this...
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St...
IJCAI
2003
14 years 25 days ago
SVMC: Single-Class Classification With Support Vector Machines
Single-Class Classification (SCC) seeks to distinguish one class of data from the universal set of multiple classes. We present a new SCC algorithm that efficiently computes an ac...
Hwanjo Yu
GD
2007
Springer
14 years 5 months ago
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St...
IEEEICCI
2009
IEEE
14 years 6 months ago
Interval sets and interval-set algebras
An interval set is an interval in the power set lattice based on a universal set and is a family of subsets of the universal set. Interval sets and interval-set algebras provide a...
Yiyu Yao