5608 search results - page 119 / 1122 » On the Theory of Matchgate Computations |
IWPEC
2004
Springer
15 years 7 months ago
2004
Springer
We show that, for every finite field , the class of all representable matroids of branch-width at most a constant t has a decidable MSO theory. In the other direction, we p...
105
click to vote
ICCV
2009
IEEE
16 years 6 months ago
2009
IEEE
We present some theoretical results related to the problem
of actively searching for a target in a 3D environment,
under the constraint of a maximum search time. We define
the o...
ECCV
2002
Springer
16 years 3 months ago
2002
Springer
Abstract. Given the projection of a su cient numberof points it is possible to algebraically eliminate the camera parameters and obtain viewinvariant functions of image coordinates...
109
click to vote
PODS
2003
ACM
16 years 1 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
126
click to vote
SAC
2010
ACM
15 years 8 months ago
2010
ACM
Analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. Most problems have been shown to be undecidable in general, and decidab...