Sciweavers

8669 search results - page 127 / 1734
» Computing matrix representations
Sort
View
MP
2011
13 years 3 hour ago
Implicit solution function of P0 and Z matrix linear complementarity constraints
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
Xiaojun Chen, Shuhuang Xiang
ICIP
2007
IEEE
14 years 10 months ago
Fundamental Matrix Estimation Without Prior Match
This paper presents a probabilistic framework for computing correspondences and fundamental matrix in the structure from motion problem. Inspired by Moisan and Stival [1], we sugg...
Frédéric Sur, Marie-Odile Berger, Ni...
DATESO
2004
165views Database» more  DATESO 2004»
13 years 10 months ago
Multi-dimensional Sparse Matrix Storage
Large sparse matrices play important role in many modern information retrieval methods. These methods, such as clustering, latent semantic indexing, performs huge number of computa...
Jiri Dvorský, Michal Krátký
DBA
2006
182views Database» more  DBA 2006»
13 years 10 months ago
Matrix Apriori: Speeding Up the Search for Frequent Patterns
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
Judith Pavón, Sidney Viana, Santiago G&oacu...
DICTA
2003
13 years 10 months ago
A Robust Method for Estimating the Fundamental Matrix
In this paper, we propose a robust method to estimate the fundamental matrix in the presence of outliers. The new method uses random minimum subsets as a search engine to find inli...
C. L. Feng, Y. S. Hung