Sciweavers

1146 search results - page 111 / 230
» Finite cupping sets
Sort
View
AISC
1992
Springer
14 years 2 months ago
A Type-Coercion Problem in Computer Algebra
Abstract. An important feature of modern computer algebra systems is the support of a rich type system with the possibility of type inference. Basic features of such a type system ...
Andreas Weber
PARA
1994
Springer
14 years 2 months ago
The Full Quantum Mechanical Three Body Problem of H2+
A model describing the full quantum mechanical three body problem of the hydrogen molecular ion is presented, and some of the numerical results are subsequently discussed. The ove...
K. Museth, Gert D. Billing, J. Linderberg
CCCG
2006
13 years 11 months ago
Tight Bounds for Point Recolouring
In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of d...
Yurai Núñez Rodríguez, David ...
ACL
2001
13 years 11 months ago
Parse Forest Computation of Expected Governors
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...
Helmut Schmid, Mats Rooth
SODA
2004
ACM
80views Algorithms» more  SODA 2004»
13 years 11 months ago
Output-sensitive construction of the union of triangles
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
Eti Ezra, Micha Sharir