242 search results - page 29 / 49 » Compact Fundamental Matrix Computation |
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
163
Voted
SDM
2011
SIAM
14 years 15 days ago
2011
SIAM
Latent semantic analysis (LSA), as one of the most popular unsupervised dimension reduction tools, has a wide range of applications in text mining and information retrieval. The k...
74
Voted
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
81
Voted
IVC
2008
14 years 9 months ago
2008
In this paper, we are going to answer the following question: assuming that we have estimates for the epipolar geometry and its uncertainty between two views, how probable it is t...
TIT
2011
14 years 4 months ago
2011
— The focus of this paper is on spatial precoding in correlated multi-antenna channels where the number of datastreams is adapted independent of the number of transmit antennas. ...