385 search results - page 30 / 77 » On higher-order perceptron algorithms |
AI
2009
Springer
14 years 3 months ago
2009
Springer
This paper examines how one can obtain state of the art Chinese word segmentation using global linear models. We provide experimental comparisons that give a detailed road-map for ...
NIPS
2001
13 years 9 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Higher-order tensor decompositions are analogous to the familiar Singular Value Decomposition (SVD), but they transcend the limitations of matrices (second-order tensors). SVD is ...
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
—In this paper, we investigate a second order consensus problem in a directed graph with non-uniform time delay. This problem arises naturally in real multi-agent systems such as...