Sciweavers

923 search results - page 37 / 185
» On a generalization of Stickelberger's Theorem
Sort
View
CADE
2007
Springer
15 years 8 months ago
Semantic Selection of Premisses for Automated Theorem Proving
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Petr Pudlak
IUI
2010
ACM
15 years 8 months ago
Intelligent understanding of handwritten geometry theorem proving
Computer-based geometry systems have been widely used for teaching and learning, but largely based on mouse-andkeyboard interaction, these systems usually require users to draw fi...
Yingying Jiang, Feng Tian, Hongan Wang, Xiaolong Z...
ACMSE
2007
ACM
15 years 6 months ago
Chinese remainder theorem based group key management
In this paper, we present two new centralized group key management protocols based on the Chinese Remainder Theorem (CRT). By shifting more computing load onto the key server we o...
Xinliang Zheng, Chin-Tser Huang, Manton M. Matthew...
SIAMCO
2008
108views more  SIAMCO 2008»
15 years 1 months ago
A Viability Theorem for Morphological Inclusions
The aim of this paper is to adapt the Viability Theorem from differential inclusions (governing the evolution of vectors in a finite dimensional space) to so-called morphological i...
Thomas Lorenz
SPAA
2003
ACM
15 years 7 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman