351 search results - page 45 / 71 » Classical Logic with Partial Functions |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
ECML
2003
Springer
15 years 2 months ago
2003
Springer
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...
76
Voted
AUTOMATICA
1999
14 years 9 months ago
1999
This paper deals with the optimization of the observer trajectory for target motion analysis. The observations are made of estimated bearings. The problem consists in determining ...
SIAMCOMP
1998
14 years 9 months ago
1998
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
99
Voted
CSL
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...