76 search results - page 14 / 16 » Extending to Soft and Preference Constraints a Framework for... |
WLP
1997
Springer
13 years 11 months ago
1997
Springer
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
BMVC
2010
13 years 2 months ago
2010
View planning for three-dimensional (3D) reconstruction and inspection solves the problem of finding an efficient sequence of views allowing complete and high quality reconstructi...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
TACS
2001
Springer
13 years 11 months ago
2001
Springer
The state of the practice in object-oriented software development has moved beyond reuse of code to reuse of conceptual structures such as design patterns. This paper draws attenti...