Sciweavers

996 search results - page 94 / 200
» A general method to speed up fixed-parameter-tractable algor...
Sort
View
JMLR
2010
108views more  JMLR 2010»
14 years 11 months ago
Tree Decomposition for Large-Scale SVM Problems
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen L...
ECML
2007
Springer
15 years 11 months ago
Principal Component Analysis for Large Scale Problems with Lots of Missing Values
Abstract. Principal component analysis (PCA) is a well-known classical data analysis technique. There are a number of algorithms for solving the problem, some scaling better than o...
Tapani Raiko, Alexander Ilin, Juha Karhunen
CGF
2010
82views more  CGF 2010»
15 years 4 months ago
Poisson-Based Weight Reduction of Animated Meshes
While animation using barycentric coordinates or other automatic weight assignment methods has become a popular method for shape deformation, the global nature of the weights limi...
Eric Landreneau, Scott Schaefer
WAIFI
2010
Springer
192views Mathematics» more  WAIFI 2010»
15 years 9 months ago
Type-II Optimal Polynomial Bases
In the 1990s and early 2000s several papers investigated the relative merits of polynomial-basis and normal-basis computations for F2n . Even for particularly squaring-friendly app...
Daniel J. Bernstein, Tanja Lange
SDM
2008
SIAM
129views Data Mining» more  SDM 2008»
15 years 6 months ago
Statistical Density Prediction in Traffic Networks
Recently, modern tracking methods started to allow capturing the position of massive numbers of moving objects. Given this information, it is possible to analyze and predict the t...
Hans-Peter Kriegel, Matthias Renz, Matthias Schube...