1176 search results - page 149 / 236 » Sparse reward processes |
134
click to vote
CIKM
2005
Springer
15 years 10 months ago
2005
Springer
On Line Analysis Processing (OLAP) is a technology basically created to provide users with tools in order to explore and navigate into data cubes. Unfortunately, in huge and spars...
139
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
145
click to vote
ICCV
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
131
click to vote
KDD
1998
ACM
15 years 8 months ago
1998
ACM
For a wide variety of classification algorithms, scalability to large databases can be achieved by observing that most algorithms are driven by a set of sufficient statistics that...
126
click to vote
PAMI
2008
15 years 4 months ago
2008
The aim of this paper is to achieve seamless image stitching without producing visual artifact caused by severe intensity discrepancy and structure misalignment, given that the inp...