| 1. |
- Alaya, Cheikh Faouzi, et al.
(författare)
-
MUVIS: A System for Content-Based Indexing and Retrieval in Large Image
- 1999
-
Ingår i: Proceedings of the Conference on Storage and Retrieval for Image and Video Databases VII. - : SPIE PRESS, USA. - 0819431273 ; , s. 98-106
-
Konferensbidrag (refereegranskat)abstract
- Until recently, collections of digital images were stored in classical databases and indexed by keywords entered by a human operator. This is not longer practical, due to the growing size of these collections. Moreover, the keywords associated with an ima
|
|
| 2. |
- Angelsmark, Ola, 1972-
(författare)
-
Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications
- 2005
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- In this thesis, we will discuss the construction of algorithms for solving Constraint Satisfaction Problems (CSPs), and describe two new ways of approaching them. Both approaches are based on the idea that it is sometimes faster to solve a large number of restricted problems than a single, large, problem. One of the strong points of these methods is that the intuition behind them is fairly simple, which is a definite advantage over many techniques currently in use.The first method, the covering method, can be described as follows: We want to solve a CSP with n variables, each having a domain with d elements. We have access to an algorithm which solves problems where the domain has size e < d, and we want to cover the original problem using a number of restricted instances, in such a way that the solution set is preserved. There are two ways of doing this, depending on the amount of work we are willing to invest; either we construct an explicit covering and end up with a deterministic algorithm for the problem, or we use a probabilistic reasoning and end up with a probabilistic algorithm.The second method, called the partitioning method, relaxes the demand on the underlying algorithm. Instead of having a single algorithm for solving problems with domain less than d, we allow an arbitrary number of them, each solving the problem for a different domain size. Thus by splitting, or partitioning, the domain of the large problem, we again solve a large number of smaller problems before arriving at a solution.Armed with these new techniques, we study a number of different problems; the decision problems (d, l)-CSP and k-Colourability, together with their counting counterparts, as well as the optimisation problems Max Ind CSP, Max Value CSP, Max CSP, and Max Hamming CSP. Among the results, we find a very fast, polynomial space algorithm for determining k-colourability of graphs.
|
|
| 3. |
- Crnkovic, Ivica, et al.
(författare)
-
Specification, implementation, and deployment of components
- 2002
-
Ingår i: Communications of the ACM. - : Association for Computing Machinery (ACM). - 0001-0782 .- 1557-7317. ; 45:10, s. 35-40
-
Tidskriftsartikel (refereegranskat)abstract
- Clarifying common terminology and exploring component-based relationships.
|
|
| 4. |
|
|
| 5. |
|
|
| 6. |
- Flener, Pierre, Professor, 1964-, et al.
(författare)
-
Matrix Modelling
- 2001
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- We argue that constraint programs with one or more matrices of decision variables provide numerous benefits, as they share many patterns for which general methods can be devised, such as for symmetry breaking. On a wide range of real-life application domains, we demonstrate the generality and utility of such matrix modelling.
|
|
| 7. |
|
|
| 8. |
|
|
| 9. |
- Flener, Pierre, Professor, 1964-, et al.
(författare)
-
Symmetry in Matrix Models
- 2001
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- Many constraint satisfaction problems (such as scheduling, assignment, and configuration) can be modelled as constraint programs based on matrices of decision variables. In such matrix models, symmetry is an important feature. We study and generalise symmetry-breaking techniques, such as lexicographic ordering, and propose a labelling technique achieving the same effect.
|
|
| 10. |
|
|
