19 search results - page 3 / 4 » Tight quadrangulations on the sphere |
TVCG
2012
11 years 8 months ago
2012
—This paper develops a novel surface fitting scheme for automatically reconstructing a genus-0 object into a continuous parametric spline surface. A key contribution for making ...
JGT
2007
13 years 6 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
NIPS
2000
13 years 7 months ago
2000
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
SCHOLARPEDIA
2008
13 years 4 months ago
2008
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
SIGMOD
2006
ACM
14 years 6 months ago
2006
ACM
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...