Sciweavers

747 search results - page 39 / 150
» An Alternative Representation for QBF
Sort
View
AAAI
2007
15 years 4 months ago
Learning Voting Trees
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
Ariel D. Procaccia, Aviv Zohar, Yoni Peleg, Jeffre...
AUTOMATICA
2005
94views more  AUTOMATICA 2005»
15 years 1 months ago
Algorithms for deterministic balanced subspace identification
New algorithms for identification of a balanced state space representation are proposed. They are based on a procedure for the estimation of impulse response and sequential zero i...
Ivan Markovsky, Jan C. Willems, Paolo Rapisarda, B...
BMVC
2010
14 years 12 months ago
Manifold Learning for Multi-Modal Image Registration
The standard approach to multi-modal registration is to apply sophisticated similarity metrics such as mutual information. The disadvantage of these measures, in contrast to simpl...
Christian Wachinger, Nassir Navab
EDBT
2008
ACM
111views Database» more  EDBT 2008»
16 years 2 months ago
Schema polynomials and applications
Conceptual complexity is emerging as a new bottleneck as data-base developers, application developers, and database administrators struggle to design and comprehend large, complex...
Kenneth A. Ross, Julia Stoyanovich
UAI
2008
15 years 3 months ago
Clique Matrices for Statistical Graph Decomposition and Parameterising Restricted Positive Definite Matrices
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to d...
David Barber