Sciweavers

9659 search results - page 1710 / 1932
» Points on Computable Curves
Sort
View
TVCG
2002
109views more  TVCG 2002»
15 years 6 months ago
Robust Creation of Implicit Surfaces from Polygonal Meshes
Implicit surfaces are used for a number of tasks in computer graphics, including modeling soft or organic objects, morphing, collision detection, and constructive solid geometry. A...
Gary D. Yngve, Greg Turk
OL
2007
103views more  OL 2007»
15 years 6 months ago
Support vector machine via nonlinear rescaling method
In this paper we construct the linear support vector machine (SVM) based on the nonlinear rescaling (NR) methodology (see [9, 11, 10] and references therein). The formulation of t...
Roman A. Polyak, Shen-Shyang Ho, Igor Griva
PR
2007
293views more  PR 2007»
15 years 6 months ago
Mean shift-based clustering
In this paper, a mean shift-based clustering algorithm is proposed. The mean shift is a kernel-type weighted mean procedure. Herein, we first discuss three classes of Gaussian, C...
Kuo-Lung Wu, Miin-Shen Yang
BIB
2010
89views more  BIB 2010»
15 years 5 months ago
Knowledge-based data analysis comes of age
The emergence of high-throughput technologies for measuring biological systems has introduced problems for data interpretation that must be addressed for proper inference. First, ...
Michael F. Ochs
163
Voted
CIKM
2010
Springer
15 years 5 months ago
Yes we can: simplex volume maximization for descriptive web-scale matrix factorization
Matrix factorization methods are among the most common techniques for detecting latent components in data. Popular examples include the Singular Value Decomposition or Nonnegative...
Christian Thurau, Kristian Kersting, Christian Bau...
« Prev « First page 1710 / 1932 Last » Next »