Sciweavers

676 search results - page 9 / 136
» Sub-stochastic matrix analysis for bounds computation - Theo...
Sort
View
SMC
2010
IEEE
202views Control Systems» more  SMC 2010»
13 years 5 months ago
Evaluating the performance of nonnegative matrix factorization for constructing semantic spaces: Comparison to latent semantic a
—This study examines the ability of nonnegative matrix factorization (NMF) as a method for constructing semantic spaces, in which the meaning of each word is represented by a hig...
Akira Utsumi
ICRA
2009
IEEE
149views Robotics» more  ICRA 2009»
14 years 2 months ago
On achievable accuracy for pose tracking
Abstract—This paper presents Cramér-Rao bound-like inequalities for pose tracking, which is defined as the problem of recovering the robot displacement given two successive rea...
Andrea Censi
BIBE
2005
IEEE
124views Bioinformatics» more  BIBE 2005»
14 years 29 days ago
Approximate Global Alignment of Sequences
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
Tamer Kahveci, Venkatakrishnan Ramaswamy, Han Tao,...
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
14 years 7 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
LPAR
2010
Springer
13 years 5 months ago
ABC: Algebraic Bound Computation for Loops
Abstract. We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis...
Régis Blanc, Thomas A. Henzinger, Thibaud H...