Sciweavers

533 search results - page 15 / 107
» A Very Mathematical Dilemma
Sort
View
ISSAC
1999
Springer
116views Mathematics» more  ISSAC 1999»
13 years 11 months ago
On the Genericity of the Modular Polynomial GCD Algorithm
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
Erich Kaltofen, Michael B. Monagan
FSS
2010
97views more  FSS 2010»
13 years 5 months ago
An early approach toward graded identity and graded membership in set theory
The paper considers an early approach toward a (fuzzy) set theory with a graded membership predicate and a graded equality relation which had been developed by the German mathemat...
Siegfried Gottwald
SCP
2011
341views Communications» more  SCP 2011»
13 years 2 months ago
A generic topology library
In the field of scientific computing there is a manifold of software applications and tools available which provide methods and libraries for the solution of very specific prob...
René Heinzl, Philipp Schwaha
SIGIR
2010
ACM
13 years 11 months ago
The importance of anchor text for ad hoc search revisited
It is generally believed that propagated anchor text is very important for effective Web search as offered by the commercial search engines. “Google Bombs” are a notable illus...
Marijn Koolen, Jaap Kamps
ITP
2010
179views Mathematics» more  ITP 2010»
13 years 11 months ago
The Isabelle Collections Framework
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle/HOL formalizations and generating efficient functi...
Peter Lammich, Andreas Lochbihler