Sciweavers

4372 search results - page 224 / 875
» Algorithmic Theories of Everything
Sort
View
ACL
1994
15 years 7 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
JMIV
2007
484views more  JMIV 2007»
15 years 5 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
JFP
2002
116views more  JFP 2002»
15 years 5 months ago
Recursive subtyping revealed
Algorithms for checking subtyping between recursive types lie at the core of many programming language implementations. But the fundamental theory of these algorithms and how they...
Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pi...
159
Voted
3DPH
2009
145views Healthcare» more  3DPH 2009»
15 years 3 months ago
The Persistent Morse Complex Segmentation of a 3-Manifold
We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in ...
Herbert Edelsbrunner, John Harer