Sciweavers

87 search results - page 17 / 18
» Nearest Singular Polynomials
Sort
View
NA
2007
147views more  NA 2007»
13 years 7 months ago
An adaptive spectral least-squares scheme for the Burgers equation
A least-squares spectral collocation method for the one-dimensional inviscid Burgers equation is proposed. This model problem shows the stability and high accuracy of these scheme...
Wilhelm Heinrichs
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
14 years 8 months ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani
COMPGEOM
2003
ACM
14 years 22 days ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson
CSDA
2006
90views more  CSDA 2006»
13 years 7 months ago
Estimation in covariate-adjusted regression
Abstract: The method of covariate adjusted regression was recently proposed for situations where both predictors and response in a regression model are not directly observed, but a...
Damla Sentürk, Danh V. Nguyen
IJDAR
2002
116views more  IJDAR 2002»
13 years 7 months ago
Performance evaluation of pattern classifiers for handwritten character recognition
Abstract. This paper describes a performance evaluation study in which some efficient classifiers are tested in handwritten digit recognition. The evaluated classifiers include a s...
Cheng-Lin Liu, Hiroshi Sako, Hiromichi Fujisawa