259 search results - page 33 / 52 » Some New Directions and Questions in Parameterized Complexit... |
COMPGEOM
2000
ACM
13 years 12 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
PODS
1995
ACM
13 years 11 months ago
1995
ACM
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
Color features are among the most important features used in image database retrieval, especially in cases where no additional semantic information is available. Due to its compac...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...