Sciweavers

327 search results - page 27 / 66
» Some Elimination Problems for Matrices
Sort
View
JCT
2011
66views more  JCT 2011»
13 years 4 months ago
Enumeration of non-crossing pairings on bit strings
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
Todd Kemp, Karl Mahlburg, Amarpreet Rattan, Cliffo...
IJON
2007
134views more  IJON 2007»
13 years 9 months ago
Analysis of SVM regression bounds for variable ranking
This paper addresses the problem of variable ranking for Support Vector Regression. The relevance criteria that we proposed are based on leave-one-out bounds and some variants and...
Alain Rakotomamonjy
ICDE
2010
IEEE
238views Database» more  ICDE 2010»
14 years 4 months ago
Correlation hiding by independence masking
— Extracting useful correlation from a dataset has been extensively studied. In this paper, we deal with the opposite, namely, a problem we call correlation hiding (CH), which is...
Yufei Tao, Jian Pei, Jiexing Li, Xiaokui Xiao, Ke ...
ICRA
2003
IEEE
101views Robotics» more  ICRA 2003»
14 years 3 months ago
A Branch-and-Prune Algorithm for Solving Systems of Distance Constraints
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
Josep M. Porta, Federico Thomas, Lluís Ros,...
CVPR
2006
IEEE
14 years 12 months ago
Selecting Principal Components in a Two-Stage LDA Algorithm
Linear Discriminant Analysis (LDA) is a well-known and important tool in pattern recognition with potential applications in many areas of research. The most famous and used formul...
Aleix M. Martínez, Manli Zhu