Sciweavers

19866 search results - page 369 / 3974
» Computing all factorizations in ***
Sort
View
ANTS
2008
Springer
115views Algorithms» more  ANTS 2008»
15 years 8 months ago
Computing Hilbert Modular Forms over Fields with Nontrivial Class Group
In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degr...
Lassina Dembélé, Steve Donnelly
ACL
2001
15 years 8 months ago
Computational Properties of Environment-based Disambiguation
The standard pipeline approach to semantic processing, in which sentences are morphologically and syntactically resolved to a single tree before they are interpreted, is a poor fi...
William Schuler
COLING
1992
15 years 8 months ago
Data Types In Computational Phonology
This paper exanfines certain aspects of phonological structure from the viewpoint of ahstract data types, Our imnlediate goal is to find a format for l)honological representation ...
Ewan Klein
CCCG
2009
15 years 8 months ago
New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Lin
In this paper, we present new algorithms for computing maximum perimeter and maximum area of the convex hull of imprecise inputs based on the parallel line segment model. The runn...
Wenqi Ju, Jun Luo
135
Voted
FOCM
2008
59views more  FOCM 2008»
15 years 6 months ago
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals
For an ideal I R[x] given by a set of generators, a new semidefinite characterization of its real radical I(VR(I)) is presented, provided it is zero-dimensional (even if I is not...
Jean B. Lasserre, Monique Laurent, Philipp Rostals...