4403 search results - page 354 / 881 » Galois Theory of Algorithms |
171
click to vote
AAAI
2007
15 years 9 months ago
2007
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...
168
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
173
click to vote
IPMU
2010
Springer
15 years 8 months ago
2010
Springer
In this work, we focus on an improvement of a multi-script handwritting recognition system using a HMM based classifiers combination. The improvement relies on the use of Dempster-...
175
Voted
ACL
2007
15 years 8 months ago
2007
This paper proposes a supervised learning method for detecting a semantic relation between a given pair of named entities, which may be located in different sentences. The method ...
163
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-inter...