2703 search results - page 90 / 541 » Working Class Hero |
107
Voted
ICDAR
2009
IEEE
15 years 9 months ago
2009
IEEE
We propose an efficient method to recognize multi-stroke handwritten symbols. The method is based on computing the truncated Legendre-Sobolev expansions of the coordinate functio...
114
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
In 1990, E. Baum gave an elegant polynomial-time algorithm for learning the intersection of two origin-centered halfspaces with respect to any symmetric distribution (i.e., any D s...
139
Voted
FROCOS
2009
Springer
15 years 9 months ago
2009
Springer
Deduction modulo consists in applying the inference rules of a deductive system modulo a rewrite system over terms and formulæ. This is equivalent to proving within a so-called co...
113
click to vote
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
130
Voted
TABLEAUX
2009
Springer
15 years 9 months ago
2009
Springer
We define a notion of formula schema handling arithmetic parameters, indexed propositional variables (e.g. Pi) and iterated conjunctions/disjunctions (e.g. Vn i=1 Pi, where n is a...