19 search results - page 3 / 4 » Tight quadrangulations on the sphere |
108
click to vote
TVCG
2012
13 years 2 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
14 years 11 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
15 years 1 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...
127
click to vote
SCHOLARPEDIA
2008
14 years 10 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...
171
click to vote
SIGMOD
2006
ACM
16 years 1 days 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...