Sciweavers

114 search results - page 17 / 23
» On the structure of compatible rational functions
Sort
View
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
14 years 26 days ago
Algorithms for the non-monic case of the sparse modular GCD algorithm
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈   [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
Jennifer de Kleine, Michael B. Monagan, Allan D. W...
NIPS
2008
13 years 8 months ago
Optimal Response Initiation: Why Recent Experience Matters
In most cognitive and motor tasks, speed-accuracy tradeoffs are observed: Individuals can respond slowly and accurately, or quickly yet be prone to errors. Control mechanisms gove...
Matt Jones, Michael C. Mozer, Sachiko Kinoshita
DM
2008
94views more  DM 2008»
13 years 7 months ago
Discrete transformation hypergroups and transformation hypergroups with phase tolerance space
Tolerance spaces and algebraic structures with compatible tolerances play an important role in contemporary algebra and their applications. In this contribution we are presenting ...
Sárka Hosková, Jan Chvalina
BMCBI
2008
144views more  BMCBI 2008»
13 years 7 months ago
Pep-3D-Search: a method for B-cell epitope prediction based on mimotope analysis
Background: The prediction of conformational B-cell epitopes is one of the most important goals in immunoinformatics. The solution to this problem, even if approximate, would help...
Yanxin Huang, Yongli Bao, Shu Yan Guo, Yan Wang, C...
SIGSOFT
2009
ACM
14 years 8 months ago
Fitting the pieces together: a machine-checked model of safe composition
Programs of a software product line can be synthesized by composing features which implement a unit of program functionality. In most product lines, only some combination of featu...
Benjamin Delaware, William R. Cook, Don S. Batory