728 search results - page 28 / 146 » Efficient Searching with Linear Constraints |
123
click to vote
ICCV
2003
IEEE
16 years 3 months ago
2003
IEEE
We present a new approach to 3D scene modeling based on geometric constraints. Contrary to the existing methods, we can quickly obtain 3D scene models that respect the given const...
121
click to vote
AUSAI
2001
Springer
15 years 5 months ago
2001
Springer
The Apriori algorithm's frequent itemset approach has become the standard approach to discovering association rules. However, the computation requirements of the frequent item...
116
click to vote
AIPS
2004
15 years 3 months ago
2004
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
106
click to vote
NPC
2004
Springer
15 years 7 months ago
2004
Springer
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...
SAC
2005
ACM
15 years 7 months ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...