Sciweavers

77 search results - page 6 / 16
» Complete, exact, and efficient computations with cubic curve...
Sort
View
VC
2011
106views more  VC 2011»
13 years 1 months ago
Width-bounded geodesic strips for surface tiling
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...
Joe Kahlert, Matt Olson, Hao Zhang 0002
PRL
2010
209views more  PRL 2010»
13 years 1 months ago
Efficient update of the covariance matrix inverse in iterated linear discriminant analysis
For fast classification under real-time constraints, as required in many imagebased pattern recognition applications, linear discriminant functions are a good choice. Linear discr...
Jan Salmen, Marc Schlipsing, Christian Igel
CAGD
2005
93views more  CAGD 2005»
13 years 6 months ago
Simple local interpolation of surfaces using normal vectors
A simple algorithm for surface interpolation is proposed. Its central idea is quadratic interpolation of a curved segment from the position and normal vectors at the end points, w...
Takashi Nagata
KDD
2004
ACM
179views Data Mining» more  KDD 2004»
14 years 7 months ago
1-dimensional splines as building blocks for improving accuracy of risk outcomes models
Transformation of both the response variable and the predictors is commonly used in fitting regression models. However, these transformation methods do not always provide the maxi...
David S. Vogel, Morgan C. Wang
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 6 months ago
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...