Sciweavers

4403 search results - page 226 / 881
» Galois Theory of Algorithms
Sort
View
ECAI
1992
Springer
15 years 10 months ago
Phenomenology, Representations and Complexity
Abstract. The paper refutes the general phenomenological argument that knowledge cannot be completely represented by symbols and, hence, symbolic AI does not work. Moreover, the vi...
Achim G. Hoffmann
COLT
2008
Springer
15 years 8 months ago
Learning from Collective Behavior
Inspired by longstanding lines of research in sociology and related fields, and by more recent largepopulation human subject experiments on the Internet and the Web, we initiate a...
Michael Kearns, Jennifer Wortman
ACL
1994
15 years 8 months ago
Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars
The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorit...
John Carroll
AAECC
2009
Springer
140views Algorithms» more  AAECC 2009»
15 years 7 months ago
Interesting Examples on Maximal Irreducible Goppa Codes
In this paper a full categorization of irreducible classical Goppa codes of degree 4 and length 9 is given. It is an interesting example in the context of find the number of permut...
Marta Giorgetti
384
Voted
JMIV
2007
484views more  JMIV 2007»
15 years 6 months ago
On Semismooth Newton's Methods for Total Variation Minimization
In [2], Chambolle proposed an algorithm for minimizing the total variation of an image. In this short note, based on the theory on semismooth operators, we study semismooth Newton...
Michael K. Ng, Liqun Qi, Yu-Fei Yang, Yu-Mei Huang