8669 search results - page 133 / 1734 » Computing matrix representations |
SCIA
2009
Springer
14 years 3 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
ICDM
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—Non-negative matrix factorization (NMF) has recently received a lot of attention in data mining, information retrieval, and computer vision. It factorizes a non-negative...
DIS
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. One of the main goals of Discovery Science is the development and analysis of methods for automatic knowledge discovery in the natural sciences. A central area of natural...
MCS
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. In this paper we present a novel approach to combining multiple kernels where the kernels are computed from different information channels. In contrast to traditional me...